coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/problem/kids-with-the-greatest-number-of-candies.html
View File

@@ -5,7 +5,7 @@
<p>Note that <strong>multiple</strong> kids can have the <strong>greatest</strong> number of candies.</p>
<p>&nbsp;</p>
<p><strong>Example 1:</strong></p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong> candies = [2,3,5,1,3], extraCandies = 3
@@ -18,7 +18,7 @@
- Kid 5, they will have 3 + 3 = 6 candies, which is the greatest among the kids.
</pre>
<p><strong>Example 2:</strong></p>
<p><strong class="example">Example 2:</strong></p>
<pre>
<strong>Input:</strong> candies = [4,2,1,1,2], extraCandies = 1
@@ -27,7 +27,7 @@
Kid 1 will always have the greatest number of candies, even if a different kid is given the extra candy.
</pre>
<p><strong>Example 3:</strong></p>
<p><strong class="example">Example 3:</strong></p>
<pre>
<strong>Input:</strong> candies = [12,1,12], extraCandies = 10