[leetcode] 1679. Max Number of K-Sum Pairs

Description

You are given an integer array nums and an integer k.

In one operation, you can pick two numbers from the array whose sum equals k and remove them from the array.

Return the maximum number of operations you can perform on the array.

Example 1:

Input: nums = [1,2,3,4], k = 5
Output: 2
Explanation: Starting with nums = [1,2,3,4]:
- Remove numbers 1 and 4, then nums = [2,3]
- Remove numbers 2 and 3, then nums = []
There are no more pairs that sum up to 5, hence a total of 2 operations.

Example 2:

Input: nums = [3,1,3,4,3], k = 6
Output: 1
Explanation: Starting with nums = [3,1,3,4,3]:
- Remove the first two 3's, then nums = [1,4,3]
There are no more pairs that sum up to 6, hence a total of 1 operation.

Constraints:

• 1 <= nums.length <= 105
• 1 <= nums[i] <= 109
• 1 <= k <= 109

分析

题目的意思是：给定一个数组，每次移除两个数和为k的数，求出移除的步数。这道题思路也很直接，用字典d来统计数的频率，然后根据字典中保存的数来判断两数和为k的对数，这样的话就比较容易的求出来了，找出两数和为k的对数就是最终的结果了。

代码

class Solution:
    def maxOperations(self, nums: List[int], k: int) -> int:
        d=defaultdict(int)
        res=0
        for num in nums:
            remain=k-num
            if(remain in d and d[remain]>0):
                d[remain]-=1
                res+=1
            else:
                d[num]+=1
        return res