地址:1679. K 和数对的最大数目
结果:AC
代码:
class Solution {
public:
int maxOperations(vector<int>& nums, int k) {
int i = 0, j = nums.size()-1;
int ans = 0;
sort(nums.begin(),nums.end());
while(i<j){
if(nums[i] + nums[j] == k){
ans++;
i++;
j--;
}else if(nums[i]+ nums[j] < k){
i++;
}else {
j--;
}
}
return ans;
}
};