【 非递增顺序的最小子序列(1403-java)】

非递增顺序的最小子序列(1403-java)

public class LC226_1403_minSubsequence {
    //排序
    public static List<Integer> minSubsequence(int[] nums) {
        //分析题意
        //1.排序
        //2.求总和
        //3.逆序找sum>total-sum
        //4.return 结果
        Arrays.sort(nums);
        int total = 0;
        int sum = 0;
        for (int num : nums) {
            total += num;
        }
        List<Integer> ans = new ArrayList<>();
        for (int i = nums.length - 1; i >= 0; i--) {
            sum += nums[i];
            ans.add(nums[i]);
            if (sum>(total-sum)){
                break;
            }
        }
        return ans;
    }

    public static void main(String[] args) {
        List<Integer> integers = minSubsequence(new int[]{4, 3, 10, 9, 8});
        for (Integer integer : integers) {
            System.out.print(integer + " ");
        }

    }

}