Solution (leetcode-in-java 1.13 API)

java.lang.Object
- g2001_2100.s2099_find_subsequence_of_length_k_with_the_largest_sum.Solution

```
public class Solution
extends Object
```

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int[] maxSubsequence(int[] nums, int k)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

maxSubsequence

public int[] maxSubsequence(int[] nums,
                            int k)