목록Count Largest Group (1)
kohigowild
221202 :: [leetcode] Count Largest Group, Minimum Moves to Equal Array Elements II, Longest Common Subsequence
Count Largest Group You are given an integer n. Each number from 1 to n is grouped according to the sum of its digits. Return the number of groups that have the largest size. Example 1: Input: n = 13 Output: 4 Explanation: There are 9 groups in total, they are grouped according sum of its digits of numbers from 1 to 13: [1,10], [2,11], [3,12], [4,13], [5], [6], [7], [8], [9]. There are 4 groups ..
Algorithm
2022. 12. 2. 23:11