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].
https://leetcode.com/problems/two-sum/description/
我想出来的办法,简单粗暴
-
class Solution {
-
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[i]+nums[j]==target){
-
return new int[]{i,j};
-
}
-
}
-
}
-
return new int[]{};
-
}
- }
另附网上的一段代码，优雅很多
-
class Solution {
-
public int[] twoSum(int[] nums, int target) {
-
HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
-
-
for (int i = 0; i < nums.length; i++) {
-
if (map.get(nums[i]) != null) {
-
int[] result = { map.get(nums[i]), i };
-
return result;
-
}
-
map.put(target - nums[i], i);
-
}
-
-
int[] result = {};
-
return result;
-
-
}
- }
来自 “ ITPUB博客 ” ，链接：https://blog.itpub.net/29254281/viewspace-2143018/ ，如需转载，请注明出处，否则将追究法律责任。
请登录后发表评论
登录
全部评论
