mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 23:41:41 +08:00
存量题库数据更新
This commit is contained in:
@@ -8,7 +8,7 @@
|
||||
<p>Return <em>the <strong>maximum</strong> number of groups that can be formed</em>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> grades = [10,6,12,7,3,5]
|
||||
@@ -20,7 +20,7 @@
|
||||
It can be shown that it is not possible to form more than 3 groups.
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> grades = [8,8]
|
||||
|
Reference in New Issue
Block a user