每日之两数之和

两数之和

https://leetcode-cn.com/problems/two-sum/
可用点:
一遍hash利用了map的特性,key保存值,value保存数组下标时能保证key对应的两个值的和等于目标值之间保存下标

1.循环暴力法

class Solution {
    public int[] twoSum(int[] nums, int target) {
        for (int i = 0; i < nums.length; i++) {
            for (int j = i + 1; j < nums.length; j++) {
                if (nums[j] == target - nums[i]) {
                    return new int[] { i, j };
                }
            }
        }
        throw new IllegalArgumentException("No two sum solution");
    }
}

2.一遍哈希表

class Solution {
    public int[] twoSum(int[] nums, int target) {
        Map<Integer,Integer> map=new HashMap<>(nums.length);
        for(int i=0;i<nums.length;i++){
            int index=target-nums[i];
            if(map.containsKey(index)){
              return new int[]{map.get(index),i};
            }
            map.put(nums[i],i);
        }
        throw new IllegalArgumentException("No two sum solution");
    }
}