Package g1601_1700.s1679_max_number_of_k_sum_pairs

Class Solution

java.lang.Object

g1601_1700.s1679_max_number_of_k_sum_pairs.Solution

public class Solution
extends Object

1679 - Max Number of K-Sum Pairs.<p>Medium</p> <p>You are given an integer array <code>nums</code> and an integer <code>k</code>.</p> <p>In one operation, you can pick two numbers from the array whose sum equals <code>k</code> and remove them from the array.</p> <p>Return <em>the maximum number of operations you can perform on the array</em>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [1,2,3,4], k = 5</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> Starting with nums = [1,2,3,4]:</p> <ul> <li> <p>Remove numbers 1 and 4, then nums = [2,3]</p> </li> <li> <p>Remove numbers 2 and 3, then nums = []</p> </li> </ul> <p>There are no more pairs that sum up to 5, hence a total of 2 operations.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [3,1,3,4,3], k = 6</p> <p><strong>Output:</strong> 1</p> <p><strong>Explanation:</strong> Starting with nums = [3,1,3,4,3]:</p> <ul> <li>Remove the first two 3&rsquo;s, then nums = [1,4,3]</li> </ul> <p>There are no more pairs that sum up to 6, hence a total of 1 operation.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 10⁵</code></li> <li><code>1 <= nums[i] <= 10⁹</code></li> <li><code>1 <= k <= 10⁹</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	maxOperations(int[] nums, int k)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

maxOperations

public int maxOperations(int[] nums,
 int k)