哈希表类刷题day8（LeetCode1）

前言：努力刷题day8

<

LeetCode 1. 两数之和传送门

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