暴力方法:
时间复杂度O(n^2)
空间复杂度O(1)
public int[] twoSum(int[] nums, int target) {
for (int i = 0; i < nums.length; i++) {
for (int j = i + 1; j < nums.length; j++) {
if (nums[j] == target - nums[i]) {
return new int[] { i, j };
}
}
}
throw new IllegalArgumentException("No two sum solution");
}
两边Hash表:
时间复杂度O(n)
空间复杂度O(n)
public int[] twoSum(int[] nums, int target) {
Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
map.put(nums[i],i);
}
System.out.println("map = " + map);
for (int i = 0; i < nums.length; i++) {
int result = target - nums[i];
if (map.containsKey(result) && map.get(result)!=i){
return new int[] { i, map.get(result) };
}
}
throw new IllegalArgumentException("No two sum solution");
}