Time: 3 ms (86.19%), Space: 46.2 MB (13.76%) - LeetHub

Author: maniezhilan

1-two-sum/1-two-sum.java

@@ -0,0 +1,15 @@
+class Solution {
+    public int[] twoSum(int[] nums, int target) {
+        Map<Integer,Integer> map = new HashMap<Integer,Integer>();
+        
+        for(int i=0; i< nums.length; i++){
+            int complement = target - nums[i];
+            if(map.containsKey(complement)) {
+                 return new int[] { map.get(complement), i};
+            }else{
+                map.put(nums[i],i);
+            }
+        }
+        return null;
+    }
+}