x-of-a-kind-in-a-deck-of-cards

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>deck</code> where <code>deck[i]</code> represents the number written on the <code>ith</code> card.

Partition the cards into one or more groups such that:

<ul>
	<li>Each group has exactly <code>x</code> cards where <code>x &gt; 1</code>, and</li>
	<li>All the cards in one group have the same integer written on them.</li>
</ul>

Return <code>true</code> if such partition is possible, or <code>false</code> otherwise.

&nbsp;
Example 1:

<pre>
Input: deck = [1,2,3,4,4,3,2,1]
Output: true
Explanation: Possible partition [1,1],[2,2],[3,3],[4,4].
</pre>

Example 2:

<pre>
Input: deck = [1,1,1,2,2,2,3,3]
Output: false
Explanation: No possible partition.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= deck.length &lt;= 104</code></li>
	<li><code>0 &lt;= deck[i] &lt; 104</code></li>
</ul>

hasGroupsSizeX

X of a Kind in a Deck of Cards

Array

Hash Table

Math

Counting

Number Theory

给定一副牌，每张牌上都写着一个整数。

此时，你需要选定一个数字 <code>X</code>，使我们可以将整副牌按下述规则分成 1 组或更多组：

<ul>
	<li>每组都有&nbsp;<code>X</code>&nbsp;张牌。</li>
	<li>组内所有的牌上都写着相同的整数。</li>
</ul>

仅当你可选的 <code>X &gt;= 2</code> 时返回&nbsp;<code>true</code>。

&nbsp;

示例 1：

<pre>
输入：deck = [1,2,3,4,4,3,2,1]
输出：true
解释：可行的分组是 [1,1]，[2,2]，[3,3]，[4,4]
</pre>

示例 2：

<pre>
输入：deck = [1,1,1,2,2,2,3,3]
输出：false
解释：没有满足要求的分组。
</pre>

 
提示：

<ul>
	<li><code>1 &lt;= deck.length &lt;= 104</code></li>
	<li><code>0 &lt;= deck[i] &lt; 104</code></li>
</ul>