Two Sum

2017-09-12  本文已影响0人  Wenyue_offer

链接

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

猜你喜欢

热点阅读