coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-13 17:35:14 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2025-09-29 14:43:44 +08:00
parent 2862a227c4
commit 13f2098086
4409 changed files with 168933 additions and 166256 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode-cn/problem (English)/统计最大组的数目(English) [count-largest-group].html
View File

@@ -1,8 +1,8 @@
<p>You are given an integer <code>n</code>.</p>
<p>Each number from <code>1</code> to <code>n</code> is grouped according to the sum of its digits.</p>
<p>We need to group the numbers from <code>1</code> to <code>n</code> according to the sum of its digits. For example, the numbers 14 and 5 belong to the <strong>same</strong> group, whereas 13 and 3 belong to <strong>different</strong> groups.</p>
<p>Return <em>the number of groups that have the largest size</em>.</p>
<p>Return the number of groups that have the largest size, i.e. the <strong>maximum</strong> number of elements.</p>
<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>