Package g2201_2300.s2206_divide_array_into_equal_pairs

Class Solution

java.lang.Object

g2201_2300.s2206_divide_array_into_equal_pairs.Solution

public class Solution
extends Object

2206 - Divide Array Into Equal Pairs\. Easy You are given an integer array `nums` consisting of `2 * n` integers. You need to divide `nums` into `n` pairs such that: * Each element belongs to **exactly one** pair. * The elements present in a pair are **equal**. Return `true` _if nums can be divided into_ `n` _pairs, otherwise return_ `false`. **Example 1:** **Input:** nums = [3,2,3,2,2,2] **Output:** true **Explanation:** There are 6 elements in nums, so they should be divided into 6 / 2 = 3 pairs. If nums is divided into the pairs (2, 2), (3, 3), and (2, 2), it will satisfy all the conditions. **Example 2:** **Input:** nums = [1,2,3,4] **Output:** false **Explanation:** There is no way to divide nums into 4 / 2 = 2 pairs such that the pairs satisfy every condition. **Constraints:** * `nums.length == 2 * n` * `1 <= n <= 500` * `1 <= nums[i] <= 500`

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
boolean	divideArray(int[] nums)

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

divideArray

public boolean divideArray(int[] nums)