max-number-of-k-sum-pairs

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an integer array <code>nums</code> and an integer <code>k</code>.

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

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

&nbsp;
Example 1:

<pre>
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.</pre>

Example 2:

<pre>
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&#39;s, then nums = [1,4,3]
There are no more pairs that sum up to 6, hence a total of 1 operation.</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 109</code></li>
	<li><code>1 &lt;= k &lt;= 109</code></li>
</ul>

maxOperations

Max Number of K-Sum Pairs

Two Sum

two-sum

两数之和

Count Good Meals

count-good-meals

大餐计数

Divide Players Into Teams of Equal Skill

divide-players-into-teams-of-equal-skill

划分技能点相等的团队

Array

Hash Table

Two Pointers

Sorting

给你一个整数数组 <code>nums</code> 和一个整数 <code>k</code> 。

每一步操作中，你需要从数组中选出和为 <code>k</code> 的两个整数，并将它们移出数组。

返回你可以对数组执行的最大操作数。

 

示例 1：

<pre>
输入：nums = [1,2,3,4], k = 5
输出：2
解释：开始时 nums = [1,2,3,4]：
- 移出 1 和 4 ，之后 nums = [2,3]
- 移出 2 和 3 ，之后 nums = []
不再有和为 5 的数对，因此最多执行 2 次操作。</pre>

示例 2：

<pre>
输入：nums = [3,1,3,4,3], k = 6
输出：1
解释：开始时 nums = [3,1,3,4,3]：
- 移出前两个 3 ，之后nums = [1,4,3]
不再有和为 6 的数对，因此最多执行 1 次操作。</pre>

 

提示：

<ul>
	<li><code>1 <= nums.length <= 105</code></li>
	<li><code>1 <= nums[i] <= 109</code></li>
	<li><code>1 <= k <= 109</code></li>
</ul>