# 846. Hand of Straights

## 题目

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.

### 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

Note: This question is the same as 1296: https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/

## 题解

``````    public boolean isNStraightHand(int[] hand, int groupSize) {
if(hand.length%groupSize != 0) {
return false;
}else if(groupSize == 1) {
return true;
}
Arrays.sort(hand);
for(int i=0;i<hand.length;i++){
if(hand[i] == -1) continue;
int pre = hand[i];
int count = 1;
for(int j=i+1;j<hand.length;j++){
if(hand[j] == pre+1){
pre = hand[j];
hand[j] = -1;
count++;
}
if(count == groupSize){
break;
}
}
if(count != groupSize) return false;
}
return true;
}``````
``````执行结果：通过

8 ms, 在所有 Java 提交中击败了 100.00% 的用户

73 / 73``````