class Solution {
public int[] twoSum(int[] nums, int target) {
Map<Integer, Integer> map = new HashMap<>();
Set<Integer> set = new HashSet<>();
for (int i = 0; i < nums.length; i++) {
Integer num = nums[i];
if (!set.contains(num)) {
map.put(num, i);
set.add(target - num);
} else {
return new int[]{map.get(target - num), i};
}
}
return null;
}
}
注:
1. 普通暴力方法要O(N^2)
2. 用Set的方法可以降低为O(N)