Leetcode Weekly Contest 302
2341. Maximum Number of Pairs in Array, My C++ code is Accepted.
中文解說

You are given a 0-indexed integer array nums. In one operation, you may do the following:

Choose two integers in nums that are equal.
Remove both integers from nums, forming a pair.
The operation is done on nums as many times as possible.

Return a 0-indexed integer array answer of size 2 where answer[0] is the number of pairs that are formed and answer[1] is the number of leftover integers in nums after doing the operation as many times as possible.

*你好，本文不接受留言，有問題請到Linkedin找我，謝謝。

轉貼政策:著明作者 Billour Ou 歐育溙 就可以自由轉貼。
*你好，本文不接受留言，有問題請到Linkedin找我，謝謝。

關於作者:
Billour Ou
歐育溙的資歷

簡歷:
Google Technical Lead 面試邀請
Yahoo bid, 百萬成功賣家
台灣教育部 DSP 競賽全國, 第一名