Max Number of K-Sum Pairs LeetCode solution in Python

1
class Solution:
2
    def maxOperations(self, nums: List[int], k: int) -> int:
3
        nums.sort()
4
        left = 0
5
        right = len(nums) - 1
6
        ans = 0
7
        while left < right:
8
            cur = nums[left] + nums[right]
9
            if cur == k:
10
                ans += 1
11
                left += 1
12
                right -= 1
13
            elif cur < k:
14
                left += 1
15
            else:
16
                right -= 1
17

18
        return ans