added test

willddy · willddy · commit 1f8194edaf13 · 2019-07-31T14:24:52.000-04:00
diff --git a/src/main/java/com/fishercoder/solutions/_1.java b/src/main/java/com/fishercoder/solutions/_1.java
@@ -1,5 +1,6 @@
 package com.fishercoder.solutions;
 
+import java.util.Arrays;
 import java.util.HashMap;
 import java.util.Map;
 
@@ -29,4 +30,27 @@ public int[] twoSum(int[] nums, int target) {
         }
     }
 
+    public static class Solution2 {
+        public int[] twoSum(int[] nums, int target) {
+            Map<Integer, Integer> hm = new HashMap<>();
+            int len = nums.length;
+            for (int i = 0; i < len; i++) {
+                int diff = target - nums[i];
+                if (hm.containsKey(diff)) {
+                    return new int[]{hm.get(diff), i};
+                } else {
+                    hm.put(nums[i], i);
+                }
+            }
+            return new int[]{-1, -1};
+        }
+    }
+
+    public static void main(String[] args) {
+        int[] array = new int[] {2, 7, 11, 16};
+        int target = 9;
+        System.out.println(Arrays.toString(new Solution1().twoSum(array, target)));
+        System.out.println(Arrays.toString(new Solution2().twoSum(array, target)));
+    }
+
 }
diff --git a/src/main/java/com/fishercoder/solutions/_2.java b/src/main/java/com/fishercoder/solutions/_2.java
@@ -2,6 +2,8 @@
 
 import com.fishercoder.common.classes.ListNode;
 
+import java.util.List;
+
 /**
  * 2. Add Two Numbers
 
@@ -39,4 +41,31 @@ public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
         }
     }
 
+    public static class Solution2 {
+        public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
+            ListNode c1 = l1;
+            ListNode c2 = l2;
+            ListNode c3 = new ListNode(0);
+            ListNode head = c3;
+            int carry = 0;
+            while(c1 != null || c2 != null) {
+                if(c1 != null) {
+                    carry += c1.val;
+                    c1 = c1.next;
+                }
+                if(c2 != null) {
+                    carry += c2.val;
+                    c2 = c2.next;
+                }
+                c3.next = new ListNode(carry % 10);
+                carry = carry / 10;
+                c3 = c3.next;
+            }
+            if (carry == 1)
+                c3.next = new ListNode(1);//this means there's a carry, so we add additional 1, e.g. [5] + [5] = [0, 1]
+
+            return head.val == 0 ? head.next : head;
+        }
+    }
+
 }
