LeetCode-Answer/1399.统计最大组的数目.c at master · zhangjunxiongjie/LeetCode-Answer · GitHub

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
38
39
40
41
42
43
44
45
46
47
/*
 * @lc app=leetcode.cn id=1399 lang=c
 *
 * [1399] 统计最大组的数目
 */

// @lc code=start


int countLargestGroup(int n){

    int assistantVector[37];
    int maximumCounter = 0;
    int resultCounter = 0;

    memset(assistantVector, 0, (sizeof(int) * 37));

    for (int i = 1; i <= n; i++) {

        int sum = 0;
        int middle = i;
        while (0 != middle) {

            sum += (middle % 10);
            middle /= 10;
        }

        assistantVector[sum]++;
        if (maximumCounter < assistantVector[sum]) {

            maximumCounter = assistantVector[sum];
        }

    }

    for (int i = 0; i < 37; i++) {

        if (assistantVector[i] == maximumCounter) {

            resultCounter++;
        }
    }

    return resultCounter;
}

// @lc code=end