LeetCode 228场周赛第四题 最接近目标值的子序列和

题目链接
dfs枚举所有子序列和
一个长度为n的数组的所有子序列和的个数为2^n
对于每一个元素，有选/不选两种情况
由于问题给的数组长度最大为40，如果直接对整个数组求所有子序列和则最大时间复杂度级别达到2^40，于是可以将问题转换为求左半边和右半边数组的所有子序列和。然后对左半数组从小到大排序，右半数组从大到小排序，最后用双指针技巧解决问题。

C++版

class Solution {
public:
    vector<int> left, right;
    int cnt1 = 0;
    int cnt2 = 0;
    int N; 
    void dfs1(vector<int>& nums, int i, int s){
        if(i == N/2){
            left[cnt1++] = s;
            return;
        }  
        dfs1(nums, i+1, s);
        dfs1(nums, i+1, s+nums[i]);
    }
    void dfs2(vector<int>& nums, int i, int s){
        
        if(i == N){
            right[cnt2++] = s;
            return;
        }
            
        dfs2(nums, i+1, s);
        dfs2(nums, i+1, s+nums[i]);
    }
    int minAbsDifference(vector<int>& nums, int goal) {
        N = nums.size();
        
        left = vector<int>(1 << (N/2));
        right = vector<int>(1 << (N-N/2));
        dfs1(nums, 0, 0);
        dfs2(nums, N/2, 0);
        
        sort(left.begin(), left.end());
        sort(right.rbegin(), right.rend());
        int ans = INT_MAX;
        int i = 0;
        int j = 0;
        while(i<left.size() && j<right.size()){
            int t = left[i] + right[j];
            ans = min(ans,abs(goal-t));
            if(t > goal) j++;
            else if(t < goal) i++;
            else return 0;
        }
        return ans;

    }
};

Java版

现在写java依然很慢== 写算法题还是C++香

class Solution {
    Integer[] left;
    Integer[] right;
    int cnt1 = 0;
    int cnt2 = 0;
    int N;
    void dfs1(int[] nums, int i, int s){
        if(i == N/2){
            left[cnt1++] = s;
            return;
        }
        dfs1(nums, i+1, s);
        dfs1(nums, i+1, s+nums[i]);
    }
    void dfs2(int[] nums, int i, int s){
        if(i==N){
            right[cnt2++] = s;
            return;
        }
        dfs2(nums, i+1, s);
        dfs2(nums, i+1, s+nums[i]);
    }
    public int minAbsDifference(int[] nums, int goal) {
        N = nums.length;
        left = new Integer[1<<(N/2)];
        right = new Integer[1<<(N-N/2)];
        dfs1(nums,0,0);
        dfs2(nums,N/2,0);
        Arrays.sort(left);
        Arrays.sort(right, Collections.reverseOrder());
        int i = 0;
        int j = 0;
        int ans = Integer.MAX_VALUE;
        while(i < left.length && j < right.length){
            Integer t = left[i] + right[j];
            if(t.compareTo(goal) > 0){
                ans = Math.min(ans, Math.abs(t-goal));
                j++;
            }
            else if(t.compareTo(goal) < 0){
                ans = Math.min(ans, Math.abs(t-goal));
                i++;
            }
            else return 0;
        }
        return ans;
    }
}