题目链接:https://leetcode.cn/problems/pairs-with-sum-lcci/
题目如下:
class Solution {
public:
vector<vector<int>> pairSums(vector<int>& nums, int target) {
//先排序,再使用双指针向中间收缩
sort(nums.begin(),nums.end());
int l=0,r=nums.size()-1;
vector<vector<int>> res;
while(l<r){
if(nums[l]+nums[r]>target) r--;
else if(nums[l]+nums[r]<target) l++;
else res.push_back({nums[l++],nums[r--]});
}
return res;
}
};