mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
43 lines
1.5 KiB
HTML
43 lines
1.5 KiB
HTML
<p>You are given an integer array <code>nums</code> and an integer <code>k</code>. You want to find a <strong>subsequence </strong>of <code>nums</code> of length <code>k</code> that has the <strong>largest</strong> sum.</p>
|
|
|
|
<p>Return<em> </em><em><strong>any</strong> such subsequence as an integer array of length </em><code>k</code>.</p>
|
|
|
|
<p>A <strong>subsequence</strong> is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [2,1,3,3], k = 2
|
|
<strong>Output:</strong> [3,3]
|
|
<strong>Explanation:</strong>
|
|
The subsequence has the largest sum of 3 + 3 = 6.</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [-1,-2,3,4], k = 3
|
|
<strong>Output:</strong> [-1,3,4]
|
|
<strong>Explanation:</strong>
|
|
The subsequence has the largest sum of -1 + 3 + 4 = 6.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [3,4,3,3], k = 2
|
|
<strong>Output:</strong> [3,4]
|
|
<strong>Explanation:</strong>
|
|
The subsequence has the largest sum of 3 + 4 = 7.
|
|
Another possible subsequence is [4, 3].
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= nums.length <= 1000</code></li>
|
|
<li><code>-10<sup>5</sup> <= nums[i] <= 10<sup>5</sup></code></li>
|
|
<li><code>1 <= k <= nums.length</code></li>
|
|
</ul>
|