leetcode 1679. Max Number of K-Sum Pairs

class Solution:
    def maxOperations(self, nums: List[int], k: int) -> int:
        ans=0
        nums.sort()
        start=0
        end=len(nums)-1
        while end>start :
            if nums[end] + nums[start] > k :
                end-=1
            elif nums[end] + nums[start] < k :
                start +=1
            else :
                ans+=1
                end -= 1
                start += 1
        return ans

 

전형적인 투 포인터 문제죠