Problem Description

Alice has some number of cards and she wants to rearrange the cards into groups so that each group is of size groupSize, and consists of groupSize consecutive cards.

Given an integer array hand where hand[i] is the value written on the ith card and an integer groupSize, return true if she can rearrange the cards, or false otherwise.

Examples

Example 1:

Input: hand = [1,2,3,6,2,3,4,7,8], groupSize = 3
Output: true
Explanation: Alice's hand can be rearranged as [1,2,3],[2,3,4],[6,7,8]

Example 2:

Input: hand = [1,2,3,4,5], groupSize = 4
Output: false
Explanation: Alice's hand can not be rearranged into groups of 4.

Constraints:

• 1 <= hand.length <= 104
• 0 <= hand[i] <= 109
• 1 <= groupSize <= hand.length

解析

給定一個整數陣列 hand, 還有一個整數 groupSize

hand 代表手中的卡片

每個 hand[i] 的值代表第 I 章卡片上的數字

groupSize 代表想要把所有卡片平均分堆,每堆內的卡片個數

而這 groupSize 的每個卡片上數字需要是 連續的

要求寫一個演算法來判斷是否能夠把手中的卡片照上面的分堆法來分