LeetCode --- 1399. Count Largest Group 解题报告
Posted 杨鑫newlfe
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode --- 1399. Count Largest Group 解题报告相关的知识,希望对你有一定的参考价值。
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 = 13 Output: 4 Explanation: 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 = 2 Output: 2 Explanation: There are 2 groups [1], [2] of size 1.
Constraints:
1 <= n <= 10^4
所有代码均可在Github中找到:
以上是关于LeetCode --- 1399. Count Largest Group 解题报告的主要内容,如果未能解决你的问题,请参考以下文章