【leetcode阿里题库】1. (Easy)Two Sum

提交代码

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

运行结果