1679.K和数对的最大数目

class Solution{
    public int maxOperations(int[] nums,int k){
        int len=nums.length;
        int left=0;
        int right=0;
        Arrays.sort(nums);
        right=len-1;
        int sum=0;
        while(left<right){
            if(nums[left]+nums[right]==k){
                sum++;
                left++;
                right--;            
            } else if(nums[left]+nums[right]<k){
                left++;            
            }else{
                right--;            
            }       
        }  
        return sum;              
    }
}