846. 一手順子
阿新 • • 發佈:2021-12-17
愛麗絲有一手(hand)由整數陣列給定的牌。
現在她想把牌重新排列成組,使得每個組的大小都是 W,且由 W 張連續的牌組成。
如果她可以完成分組就返回 true,否則返回 false。
注意:此題目與 1296 重複:https://leetcode-cn.com/problems/divide-array-in-sets-of-k-consecutive-numbers/
來源:力扣(LeetCode)
連結:https://leetcode-cn.com/problems/hand-of-straights
著作權歸領釦網路所有。商業轉載請聯絡官方授權,非商業轉載請註明出處。
心之所向,素履以往 生如逆旅,一葦以航import java.util.TreeMap; class Solution { public boolean isNStraightHand(int[] hand, int W) { TreeMap<Integer, Integer> count = new TreeMap(); for (int card: hand) { if (!count.containsKey(card)) count.put(card, 1); else count.replace(card, count.get(card) + 1); } while (count.size() > 0) { int first = count.firstKey(); for (int card = first; card < first + W; ++card) { if (!count.containsKey(card)) return false; int c = count.get(card); if (c == 1) count.remove(card); else count.replace(card, c - 1); } } return true; } }