001_LeetCode_1 Two Sum 题解

Description

---

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

给定一个整数数组，返回两个数相加等于target时这两个数对应的下标。

---

Example:

---

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

---

解：

---

• 使用HashMap，使用数组的值作为key，对应的数组下标作为value，每次遍历时，判断当前值是否已经存在于hash表的键中：
  
  • 若当前值不存在于当前表的键中，则把当前值与target的差值作为key，下标作为value，存入表。
  • 若当前值存在于key中。说明找到两个数之和为target。结果返回当前值在表中存储的value，以及当前的下标。

---

Java代码：

---

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