class Solution {
public List<Integer> minSubsequence(int[] nums) {
Arrays.sort(nums);
int sum = 0, cur = 0, index = nums.length - 1;
List<Integer> res = new ArrayList<>();
// 计算数组结果
for (int i : nums) sum += i;
while (cur <= sum){
sum -= nums[index];
cur += nums[index];
res.add(nums[index]);
index--;
}
return res;
}
}
力扣:1403. 非递增顺序的最小子序列
于 2022-08-04 23:36:36 首次发布