Problem Description
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:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
暴力求解
public static int[] fun1(int[] nums, int target) {
for (int i = 0; i < nums.length; i++) {
int temp = target - nums[i];
for (int j = i + 1; j < nums.length; j++) {
if (nums[j] == temp) {
return new int[] { i, j };
}
}
}
throw new IllegalArgumentException("No two sum solution");
}
暴力求解时间复杂度为O(n2),空间复杂度O(1)。
提交后执行时间为:17ms
优化:散列表
采用散列表存储,提高第二重循环的查询效率,但是额外增加了存储空间。
时间复杂度分析:
第一重循环执行次数为n
,在散列表中查询的时间复杂度为O(1)
,因此整体时间复杂度为O(n)
。
空间复杂度分析:
额外增加散列表存储所有数据,因此空间复杂度为O(n)
。
提交后执行时间为:7ms
代码一:
public static int[] fun2(int[] nums, int target) {
Map<Integer, Integer> map = new HashMap<Integer, Integer>();
for (int i = 0; i < nums.length; i++) {
map.put(nums[i], i);
}
for (int i = 0; i < nums.length; i++) {
int index = target - nums[i];
if (map.containsKey(index) && map.get(index) != i) {
return new int[] { i, map.get(index) };
}
}
throw new IllegalArgumentException("No two sum solution");
}
代码二:
public static int[] fun3(int[] nums, int target) {
Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
int index = target - nums[i];
if (map.containsKey(index)) {
return new int[] { map.get(index), i };
}
map.put(nums[i], i);
}
throw new IllegalArgumentException("No two sum solution");
}