Count Largest Group
给一个数字n. 求[1, n]上每个数字的digit和的最大的group的个数.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 |
class Solution { public int countLargestGroup(int n) { int[] nums = new int[1000001]; for(int i = 1; i <= n; i++) { nums[count(i)]++; } int max = 0; for(int i = 0; i < 1000001; i++) { max = Math.max(max, nums[i]); } int res = 0; for(int i = 0; i < 1000001; i++) { if(nums[i] == max){ res++; } } return res; } private int count(int n) { int res = 0; while(n != 0) { res += (n % 10); n /= 10; } return res; } } |