时隔4年,继续记录一下自己的成长历程吧。
题目:easy
Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
You can return the answer in any order.
Example 1:
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].
Example 2:
Input: nums = [3,2,4], target = 6
Output: [1,2]
Example 3:
Input: nums = [3,3], target = 6
Output: [0,1]
Constraints:
2 <= nums.length <= 103
-109 <= nums[i] <= 109
-109 <= target <= 109
Only one valid answer exists.
这道题的目标是从数组中寻找两个数,使两数之和等于目标值,并返回两个数的下标。题目挺简单的,解决办法多种多样。
16年(一刷): O(N^2)
public int[] twoSum(int[] nums, int target) {
int[] result = new int[2];
boolean flag = false;
for(int i = 0;i < nums.length - 1;i ++) {
for(int j = i + 1;j < nums.length;j ++) {
if(nums[i] + nums[j] == target) {
result[0] = i + 1;
result[1] = j + 1;
flag = true;
break;
}
}
if(flag) {
break;
}
}
return result;
}
17年(二刷): O(N^2)
public int[] twoSum(int[] nums, int target) {
int[] res = new int[2];
int len = nums.length;
for(int i = 0;i < len - 1;i ++){
for(int j = i + 1;j < len;j ++){
if(target == nums[i] + nums[j]){
res[0] = i;
res[1] = j;
return res;
}
}
}
return null;
}
19年(三刷): O(N)
public int[] twoSum(int[] nums, int target) {
if (nums == null || nums.length < 2) {
return new int[]{-1, -1};
}
Map<Integer, Integer> elementMap = new HashMap<>();
for (int i = 0, len = nums.length; i < len; i++) {
if (elementMap.containsKey(target - nums[i])) {
return new int[]{elementMap.get(target - nums[i]), i};
} else {
elementMap.put(nums[i], i);
}
}
return new int[]{-1, -1};
}