LeetCode之子集合之和

2019独角兽企业重金招聘Python工程师标准>>>

Subset sum problem

原文

Given a set of non-negative integers, and a value sum, determine if there is a subset of the given set with sum equal to given sum.

样例

Examples: set[] = {3, 34, 4, 12, 5, 2}, sum = 9 Output: True //There is a subset (4, 5) with sum 9.

限制条件

解决办法--DFS

思路

• DFS递推公式

设，subSum(set, n, sum)是这个计算公式，那么存在以下关系：

subSum(set, n, sum) = sumSum(set, n-1, sum) || subSum(set, n-1, sum-set[n-1])

终止条件：

如果sum<0，返回false

如果sum==0，返回true

如果sum>0 && n <= 0，返回false

Java实现

static boolean setSum(int[] set, int n, int sum) {
    if (sum < 0) {
        return false;
    } else if(sum == 0) {
        return true;
    } else {
        if (n <= 0) {
            return false;
        }
    }
    return setSum(set, n-1, sum) || setSum(set, n-1, sum - set[n-1]);
}

public static void main(String[] args) {
    int set[] = {3, 34, 4, 12, 5, 2};
    int sum = 9;
    int n = set.length;
    System.out.println(setSum(set, n, sum));
}

解决办法--DP

发现这个是NP问题，状态依赖于之前的状态，可以使用DP来解决，只涉及sum和n两个参数，状态转移方程：

dp[i][j] = (dp[i][j] || dp[i - set[j-1]][j-1])

i 是sum的函数 j 是n的函数

前置条件：

dp[i][0] = false; dp[0][j] = true;

Java实现

static boolean setSum(int[] set, int n, int sum) {
    boolean[][] dp = new boolean[sum+1][n+1];
    for (int j = 0; j <= n; j++) {
        dp[0][j] = true;
    }
    for (int i = 1; i < sum+1; i++) {
        dp[i][0] = false;
    }
    
    for ( int i = 1; i <= sum; i++) {
        for (int j = 1; j <= n; j++) {
            dp[i][j] = dp[i][j-1];
            if (i >= set[j-1]) {
                dp[i][j] = dp[i][j] || d[i - set[j-1]][j-1];
            }
        }
    }
    
    return dp[sum][n];
}

来源

http://www.geeksforgeeks.org/dynamic-programming-subset-sum-problem/

转载于:https://my.oschina.net/serverx/blog/841340