https://leetcode.com/problems/two-sum/
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
int i,j,len;
vector<int> res(2,0);
len=nums.size();
for (i=0;i<=len-1;i++)
for (j=i+1;j<=len-1;j++)
{
if (target==(nums[i]+nums[j]))
{
res[0]=i;
res[1]=j;
return res;
}
}
return res;
}
};
正确解法
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");
}