g0801_0900.s0846_hand_of_straights.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g0801_0900.s0846_hand_of_straights;
// #Medium #Array #Hash_Table #Sorting #Greedy #2022_03_24_Time_19_ms_(96.16%)_Space_43_MB_(93.42%)
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
public class Solution {
public boolean isNStraightHand(int[] hand, int groupSize) {
int len = hand.length;
if (len % groupSize != 0) {
return false;
}
Arrays.sort(hand);
Map map = new HashMap<>();
for (int num : hand) {
int cnt = map.getOrDefault(num, 0);
map.put(num, ++cnt);
}
for (int num : hand) {
int cnt = map.get(num);
if (cnt <= 0) {
continue;
}
map.put(num, --cnt);
int loop = 1;
while (loop < groupSize) {
int curCnt = map.getOrDefault(num + loop, 0);
if (curCnt <= 0) {
return false;
}
map.put(num + loop, --curCnt);
++loop;
}
}
return true;
}
}