leetcode序号1



示例代码
使用一个hashmap存储
public static int[] twoSum(int[] nums, int target) {
HashMap<Integer, Integer> map = new HashMap<>();
int sum = 0;
int[] result = new int[2];
for (int i = 0; i < nums.length; i++) {
sum = target - nums[i];
Integer i1 = map.get(sum);
if (i1 != null){
result[0] = i;
result[1] = i1;
break;
}
else {
map.put(nums[i],i);
}
}
return result;
}


