问题:
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
Example:
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
我的解法:一看到题目就想当然的来个2层for循环,完全忽略了时间复杂度和空间复杂度,惭愧!缺乏算法的意识
public int[] twoSum(int[] nums, int target) {
for(int i=0; i< nums.length; i++) {
for(int j=0; j<nums.length-1; j++) {
if(nums[i]+nums[j] == target) {
return new int[]{i,j};
}
}
}
throw new IllegalArgumentException("rhrow a exception!");
}
这个一瞅时间复杂度为O(n^2),空间复杂度为O(1)效率低下。
最效率算法:
public int[] twoSum(int[] nums, int target) {
Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
int complement = target - nums[i];
if (map.containsKey(complement)) {
return new int[] { map.get(complement), i };
}
map.put(nums[i], i);
}
throw new IllegalArgumentException("No two sum solution");
}
借助于map集合,一个for循环搞定,时间复杂度瞬间将为:O(n),相应的空间复杂度为:O(n)
虽然牺牲了部分空间,但是节省了时间,一饮一啄,皆是定律!
学习了。