find-subsequence-of-length-k-with-the-largest-sum

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an integer array <code>nums</code> and an integer <code>k</code>. You want to find a subsequence of <code>nums</code> of length <code>k</code> that has the largest sum.

Return any such subsequence as an integer array of length <code>k</code>.

A subsequence is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements.

&nbsp;
Example 1:

<pre>
Input: nums = [2,1,3,3], k = 2
Output: [3,3]
Explanation:
The subsequence has the largest sum of 3 + 3 = 6.</pre>

Example 2:

<pre>
Input: nums = [-1,-2,3,4], k = 3
Output: [-1,3,4]
Explanation: 
The subsequence has the largest sum of -1 + 3 + 4 = 6.
</pre>

Example 3:

<pre>
Input: nums = [3,4,3,3], k = 2
Output: [3,4]
Explanation:
The subsequence has the largest sum of 3 + 4 = 7. 
Another possible subsequence is [4, 3].
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 1000</code></li>
	<li><code>-105&nbsp;&lt;= nums[i] &lt;= 105</code></li>
	<li><code>1 &lt;= k &lt;= nums.length</code></li>
</ul>

maxSubsequence

Find Subsequence of Length K With the Largest Sum

Kth Largest Element in an Array

kth-largest-element-in-an-array

数组中的第K个最大元素

Maximize Sum Of Array After K Negations

maximize-sum-of-array-after-k-negations

K 次取反后最大化的数组和

Sort Integers by The Number of 1 Bits

sort-integers-by-the-number-of-1-bits

根据数字二进制下 1 的数目排序

Minimum Difference in Sums After Removal of Elements

minimum-difference-in-sums-after-removal-of-elements

删除元素后和的最小差值

Array

Hash Table

Sorting

Heap (Priority Queue)

给你一个整数数组&nbsp;<code>nums</code>&nbsp;和一个整数&nbsp;<code>k</code>&nbsp;。你需要找到&nbsp;<code>nums</code>&nbsp;中长度为 <code>k</code>&nbsp;的 子序列&nbsp;，且这个子序列的&nbsp;和最大&nbsp;。

请你返回 任意 一个长度为&nbsp;<code>k</code>&nbsp;的整数子序列。

子序列&nbsp;定义为从一个数组里删除一些元素后，不改变剩下元素的顺序得到的数组。

&nbsp;

示例 1：

<pre>输入：nums = [2,1,3,3], k = 2
输出：[3,3]
解释：
子序列有最大和：3 + 3 = 6 。</pre>

示例 2：

<pre>输入：nums = [-1,-2,3,4], k = 3
输出：[-1,3,4]
解释：
子序列有最大和：-1 + 3 + 4 = 6 。
</pre>

示例 3：

<pre>输入：nums = [3,4,3,3], k = 2
输出：[3,4]
解释：
子序列有最大和：3 + 4 = 7 。
另一个可行的子序列为 [4, 3] 。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 1000</code></li>
	<li><code>-105&nbsp;&lt;= nums[i] &lt;= 105</code></li>
	<li><code>1 &lt;= k &lt;= nums.length</code></li>
</ul>