filmov
tv
2206. Divide Array Into Equal Pairs | Java | Leetcode |

Показать описание
Description: You are given an integer array nums consisting of 2 * n integers.
You need to divide nums into n pairs such that:
1. Each element belongs to exactly one pair.
2. The elements present in a pair are equal.
Return true if nums can be divided into n pairs, otherwise return false.
You need to divide nums into n pairs such that:
1. Each element belongs to exactly one pair.
2. The elements present in a pair are equal.
Return true if nums can be divided into n pairs, otherwise return false.