Max Number of K-Sum Pairs

LeetCode題目: 1679. Max Number of K-Sum Pairs

My solution:

/**
 * @param {number[]} nums
 * @param {number} k
 * @return {number}
 */
let maxOperations = (nums, k) => {
    let left = 0, right = nums.length - 1, operationsCount = 0 ;
    nums.sort((a, b) => a - b);
    while(left < right){
        if(nums[left] + nums[right] === k) {
            operationsCount++;
            left++;
            right--;
        }else {
            (nums[left] + nums[right]) < k ? left++ : right--;
        }
    }
    return operationsCount;
};