Java_LeetCode1~两数之和

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.

• Example

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

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

Solution

利用哈希，来查找某值的补充值（两个数加起来等于target）。哈希存放：采用数组的值做哈希的键，数组的index做哈希的值。

Code

class Solution {
   
    public int[] twoSum(int[] nums, int target) {
    Map<Integer, Integer> map = new HashMap<>();
        
    for (int i = 0; i < nums.length; i++) {
        int complement = target - nums[i];
        if (map.containsKey(complement)) {
            return new int[] { map.get(complement), i };
        }
        map.put(nums[i], i);//注释：起初if的结果肯定是no，就这样第一对键和键值才能压入map；后续再输入的话，能匹配的值肯定已经
        //存在map中了
    }
    throw new IllegalArgumentException("No two sum solution");
}
        
  

}

Appendix

1.找的是键还是值，一定要清楚
2.Map.containsKey:是否包含某指定键
Map.get:求值
3.Boolean contains=map.containsKey(key);