coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-13 03:11:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

批量更新数据

Browse Source
This commit is contained in:
小墨
2025-01-09 20:29:41 +08:00
parent 04ecea043d
commit 48cdd06c2b
5053 changed files with 156164 additions and 135322 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
leetcode-cn/problem (Chinese)/非递增顺序的最小子序列 [minimum-subsequence-in-non-increasing-order].html
View File

@@ -10,24 +10,20 @@
<p><strong>示例 1：</strong></p>
<pre><strong>输入：</strong>nums = [4,3,10,9,8]
<pre>
<strong>输入：</strong>nums = [4,3,10,9,8]
<strong>输出：</strong>[10,9]
<strong>解释：</strong>子序列 [10,9] 和 [10,8] 是最小的、满足元素之和大于其他各元素之和的子序列。但是 [10,9] 的元素之和最大。&nbsp;
</pre>
<p><strong>示例 2：</strong></p>
<pre><strong>输入：</strong>nums = [4,4,7,6,7]
<pre>
<strong>输入：</strong>nums = [4,4,7,6,7]
<strong>输出：</strong>[7,7,6]
<strong>解释：</strong>子序列 [7,7] 的和为 14 ，不严格大于剩下的其他元素之和（14 = 4 + 4 + 6）。因此，[7,6,7] 是满足题意的最小子序列。注意，元素按非递增顺序返回。
</pre>
<p><strong>示例 3：</strong></p>
<pre><strong>输入：</strong>nums = [6]
<strong>输出：</strong>[6]
</pre>
<p>&nbsp;</p>
<p><strong>提示：</strong></p>