Leetcode/java/1.two-sum.java at master · widmonstertony/Leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
import java.util.HashMap;
import java.util.Map;

/*
 * @lc app=leetcode id=1 lang=java
 *
 * [1] Two Sum
 */

// @lc code=start
class Solution {
    public int[] twoSum(int[] nums, int target) {
        Map<Integer, Integer> numsMap = new HashMap<>();
        for (int i = 0; i < nums.length; i++) {
            int currNum = nums[i];
            if(numsMap.containsKey(target - currNum)) {
                return new int[]{numsMap.get(target - currNum), i};
            }
            numsMap.put(currNum, i);
        }
        return new int[]{};
    }
}
// @lc code=end