标签:countInGroup Kind false deck group cards item Cards 914
package LeetCode_914 /** * 914. X of a Kind in a Deck of Cards * https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards/description/ * * In a deck of cards, each card has an integer written on it. Return true if and only if you can choose X >= 2 such that it is possible to split the entire deck into 1 or more groups of cards, where: Each group has exactly X cards. All the cards in each group have the same integer. Example 1: Input: deck = [1,2,3,4,4,3,2,1] Output: true Explanation: Possible partition [1,1],[2,2],[3,3],[4,4]. Example 2: Input: deck = [1,1,1,2,2,2,3,3] Output: false´ Explanation: No possible partition. Constraints: 1 <= deck.length <= 10^4 0 <= deck[i] < 10^4 * */ class Solution { /* * solution: HashMap, calculate each deck of group, then check if can has exactly X cards * Time complexity:O(n), Space complexity:O(n) * */ fun hasGroupsSizeX(deck: IntArray): Boolean { if (deck == null || deck.isEmpty()) { return false } val map = HashMap<Int, Int>() for (item in deck) { map.put(item, map.getOrDefault(item, 0) + 1) } var countInGroup = Int.MAX_VALUE for (item in map) { countInGroup = Math.min(countInGroup, item.value) } //if each group cannot exactly 2 cards, return false if (countInGroup < 2) { return false } //keep check if each card has save group size for (i in 2 .. countInGroup) { var can = true for (item in map) { if (item.value % i != 0) { can = false break } } if (can) { return true } } return false } }
标签:countInGroup,Kind,false,deck,group,cards,item,Cards,914 来源: https://www.cnblogs.com/johnnyzhao/p/13709175.html
本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享; 2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关; 3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关; 4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除; 5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。