Leetcode1399 Count Largest Group
2022-02-05 17:31 作者:您是打尖儿还是住店呢 | 我要投稿
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 = 13Output: 4Explanation: 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 with largest size.
Example 2:
Input: n = 2Output: 2Explanation: There are 2 groups [1], [2] of size 1.
Constraints:
1 <= n <= 104
Runtime: 8 ms, faster than 59.32% of Java online submissions for Count Largest Group.
Memory Usage: 41.6 MB, less than 8.90% of Java online submissions for Count Largest Group.
