1403非遞增順序的最小子序列

package cn.com.da.lk;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.List;

/**
 * @deviceName 97738
 * @Author da
 * @Date 2022/8/4 9:31
 * @QQ 977389678
 * @Phone 15932639701
 */
public class Solution1403 {
    public static List<Integer> minSubsequence(int[] nums) {
        //轉化為對象數組
        Integer[] arrs = new Integer[nums.length];
        for (int i = 0; i < nums.length; i++) {
            arrs[i] = Integer.valueOf(nums[i]);
        }
        //求和
        int sum =0;
        for (int i=0;i<arrs.length;i++)
        {
            sum = sum +nums[i];
        }
        //自定義排序
        Arrays.sort(arrs, new Comparator<Integer>() {
            @Override
            public int compare(Integer o1, Integer o2) {
                return o2-o1;
            }
        });
        int m=0;
        int n =0;
        //比較
        for (int i =0;(i<arrs.length)&&(m<=(sum-m));i++)
        {
            m = m + arrs[i];
            n++;
        }
        //轉換為符合要求的輸出對象
       List<Integer> arr = new ArrayList<>();
        for (int i=0;i<n;i++)
        {
            arr.add(arrs[i]);
        }
        return arr;
    }

    public static void main(String[] args) {
        int nums[] ={4,4,7,6,7};
        List<Integer> integers = minSubsequence(nums);
        for (Integer a:integers)
        {
            System.out.println(a);
        }
    }
}