Skip to content

1. Two Sum

🔗 Source

Intuition

Approach

Complexity

  • Time complexity: $$
  • Space complexity: $$

Code

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
class Solution {
    public int[] twoSum(int[] nums, int target) {
        int high = nums.length;
        HashMap<Integer, Integer> h = new HashMap<>();
        for (int i = 0; i < high; i++) {
            int val = target - nums[i];
            if (h.containsKey(val)) {
                return new int[]{i, h.get(val)};
            }
            h.put(nums[i], i);
        }
        return new int[2];
    }
}