ubuntn20 搭建 redmine

文章目录

• 思路
• 解题方法
• 复杂度
• Code

思路

解题方法

复杂度

时间复杂度:

空间复杂度:

Code

class Solution {
    public static int MAXN = 1 << 20;
    public static int[] lsum = new int[MAXN];
    public static int[] rsum = new int[MAXN];

    public static int fill;

    public static int minAbsDifference(int[] nums, int goal) {
        int n = nums.length;
        int min = 0;
        int max = 0;
        for (int i = 0; i < n; i++) {
            if (nums[i] < 0) {
                min += nums[i];
            } else if (nums[i] > 0) {
                max += nums[i];
            }
        }
        if (max < goal) {
            return Math.abs(max - goal);
        }
        if (min > goal) {
            return Math.abs(min - goal);
        }
        Arrays.sort(nums);
        fill = 0;
        dfs(nums, 0, n >> 1, 0, lsum);
        int lsize = fill;
        fill = 0;
        dfs(nums, n >> 1, n, 0, rsum);
        int rsize = fill;
        Arrays.sort(lsum, 0, lsize);
        Arrays.sort(rsum, 0, rsize);
        int ans = Math.abs(goal);
        for (int i = 0, j = rsize - 1; i < lsize; i++) {
            while (j > 0 && Math.abs(goal - lsum[i] - rsum[j - 1]) <= Math.abs(goal - lsum[i] - rsum[j])) {
                j--;
            }
            ans = Math.min(ans, Math.abs(goal - lsum[i] - rsum[j]));

        }
        return ans;
    }

    public static void dfs(int[] nums, int i, int e, int s, int[] sum) {
        if (i == e) {
            sum[fill++] = s;
        } else {
            int j = i + 1;
            while (j < e && nums[j] == nums[i]) {
                j++;
            }
            for (int k = 0; k <= j - i; k++) {
                dfs(nums, j, e, s + k * nums[i], sum);
            }
        }

    }

}