Count Largest Group LeetCode solution in C++

1
class Solution {
2
 public:
3
  int cal(int n) {
4
    int sum = 0;
5
    while (n > 0) {
6
      sum += n % 10;
7
      n /= 10;
8
    }
9
    return sum;
10
  }
11

12
  int countLargestGroup(int n) {
13
    int a[40];
14
    for (int i = 0; i < 40; i++) a[i] = 0;
15

16
    for (int i = 1; i <= n; i++) {
17
      a[cal(i)]++;
18
    }
19

20
    int max = 0;
21
    int count = 0;
22
    for (int i = 0; i < 40; i++) {
23
      if (a[i] > max) {
24
        count = 1;
25
        max = a[i];
26
      } else if (a[i] == max)
27
        count++;
28
    }
29

30
    return count;
31
  }
32
};