Leetcode1. 两数之和

1. 两数之和

采用方法：哈希法

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