leetcode

Leetcode Solutions (0x6A73)
git clone https://git.pngu.org/leetcode
Log | Files | Refs | Submodules | README

count_largest_group.c (744B)

 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
29
30
31
32
33
34
35
36
37
// 1399. Count Largest Group
#include "leetcode.h"

/*
 * 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.
 */

int get_num(int n) {
  int res = 0;
  while (n) {
    res += n % 10;
    n /= 10;
  }
  return res;
}

int countLargestGroup(int n) {
  int arr[37] = {0}, max = 0;
  for (int i = 1; i <= n; i++) {
    int curr = get_num(i);
    arr[curr]++;
    if (arr[curr] > max)
      max = arr[curr];
  }
  int cnt = 0;
  for (int i = 1; i <= 36; i++)
    if (arr[i] == max)
      cnt++;
  return cnt;
}

int main() {
  printf("%d\n", countLargestGroup(13)); // expect: 4
  printf("%d\n", countLargestGroup(2));  // expect: 2
}