Minimum Subsequence in Non-Increasing Order
给一个数组, 求其中的一个子序列, 让子序列的和大于剩余元素的和.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 |
class Solution { public List<Integer> minSubsequence(int[] nums) { int sum = 0; for(int n : nums) { sum += n; } Arrays.sort(nums); int t = 0; List<Integer> res = new ArrayList<>(); for(int i = nums.length - 1; i >= 0; i--) { if(t > sum){ break; } sum -= nums[i]; res.add(nums[i]); t += nums[i]; } return res; } } |