题目描述:
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].
解释说明:给定一个数组和一个目标数字,返回一个和为该数字的两数下标。
方法一:双重循环,时间复杂度O(n2),空间复杂度O(1)。
代码实现:
class Solution {
public int[] twoSum(int[] nums, int target) {
int[] a = new int[2];
for(int i=0;i
for(int j=i+1;j
if(nums[i]+nums[j]==target){
a[0]=i;
a[1]=j;
break;
}
}
}
return a;
}
}
方法二:利用HashMap<>(),时间复杂度:
O(n)
O(n),空间复杂度:O(n)。
代码实现:
public int[] twoSum(int[] nums, int target) {
Map 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");
}
方法三:利用HashTable<>(),时间复杂度:
O(n)
O(n),空间复杂度:O(n)。
代码实现:
public int[] twoSum(int[] nums, int target) {
Map map = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
map.put(nums[i], i);
}
for (int i = 0; i < nums.length; i++) {
int complement = target - nums[i];
if (map.containsKey(complement) && map.get(complement) != i) {
return new int[] { i, map.get(complement) };
}
}
throw new IllegalArgumentException("No two sum solution");
}