代码:
class Solution {
public int maxOperations(int[] nums, int k) {
Arrays.sort(nums);
if(nums[0]>=k)return 0;
int n = nums.length;
if(n<2)return 0;
if(nums[0]+nums[1]>k)return 0;
int cnt = 0;
int idx1 = 0,idx2 = n-1;
while(nums[idx1]+nums[idx2]>k){
idx2--;
}
while(idx1<idx2){
if(nums[idx1]+nums[idx2]==k){
cnt++;
idx1++;
idx2--;
}else if(nums[idx1]+nums[idx2]>k){
idx2--;
}else{
idx1++;
}
}
return cnt;
}
}