LeetCode-in-Java
3684. Maximize Sum of At Most K Distinct Elements
Easy
You are given a positive integer array nums and an integer k.
Choose at most k elements from nums so that their sum is maximized. However, the chosen numbers must be distinct.
Return an array containing the chosen numbers in strictly descending order.
Example 1:
Input: nums = [84,93,100,77,90], k = 3
Output: [100,93,90]
Explanation:
The maximum sum is 283, which is attained by choosing 93, 100 and 90. We rearrange them in strictly descending order as [100, 93, 90].
Example 2:
Input: nums = [84,93,100,77,93], k = 3
Output: [100,93,84]
Explanation:
The maximum sum is 277, which is attained by choosing 84, 93 and 100. We rearrange them in strictly descending order as [100, 93, 84]. We cannot choose 93, 100 and 93 because the chosen numbers must be distinct.
Example 3:
Input: nums = [1,1,1,2,2,2], k = 6
Output: [2,1]
Explanation:
The maximum sum is 3, which is attained by choosing 1 and 2. We rearrange them in strictly descending order as [2, 1].
Constraints:
1 <= nums.length <= 1001 <= nums[i] <= 1091 <= k <= nums.length
Solution
import java.util.Arrays;
public class Solution {
public int[] maxKDistinct(int[] nums, int k) {
Arrays.sort(nums);
int[] arr = new int[k];
int j = 1;
arr[0] = nums[nums.length - 1];
if (nums.length > 1) {
for (int i = nums.length - 2; j < k && i >= 0; i--) {
if (i < nums.length - 1 && nums[i] != nums[i + 1]) {
arr[j] = nums[i];
j++;
}
}
}
int cnt = 0;
int n = 0;
while (n < arr.length) {
if (arr[n] != 0) {
cnt++;
}
n++;
}
int[] finl = new int[cnt];
System.arraycopy(arr, 0, finl, 0, cnt);
return finl;
}
}