这道题虽然是双指针,但是要排序之后做,这样的话就还需要记录排序后的index变化。这个语法需要记一下:
// 按nums的值排序后的idxs
sort(idxs.begin(),idxs.end(),[nums,idxs](int i, int j){
return nums[idxs[i]]<nums[idxs[j]];
});
// 查看排序后的index
for (int index : idxs) {
cout << index << " ";
}
cout << endl;
cpp实现:
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
int numslen = nums.size();
vector<int> idxs; // 排序后的index
for (int i=0; i<numslen; i++) idxs.push_back(i);
// 按nums的值排序后的idxs
sort(idxs.begin(),idxs.end(),[nums,idxs](int i, int j){
return nums[idxs[i]]<nums[idxs[j]];
});
vector<int> ret;
int left=0, right=numslen-1;
while(left<right){
int sum = nums[idxs[left]]+nums[idxs[right]];
if (sum==target){
ret.push_back(idxs[left]);
ret.push_back(idxs[right]);
break;
}
else if (sum>target){
right -=1;
}
else{// <target
left +=1;
}
}
return ret;
}
};