给定n个不同的正整数,整数k(k < = n)以及一个目标数字。
在这n个数里面找出K个数,使得这K个数的和等于目标数字,求问有多少种方案?
public class Solution { /** * @param A: An integer array * @param k: A positive integer (k <= length(A)) * @param target: An integer * @return: An integer */ public int kSum(int[] A, int k, int target) { // write your code here if (A == null || A.length == 0 || k > A.length || k <= 0) { return 0; } int[][] dp = new int[k + 1][target + 1]; for (int i = 0; i <= k; i++) { for (int j = 0; j <= target; j++) { dp[i][j] = 0; } } dp[0][0] = 1; for (int i = 0; i < A.length; i++) { for (int j = k; j >= 1; j--) { for (int s = target; s >= A[i]; s--) { dp[j][s] += dp[j - 1][s - A[i]]; } } } return dp[k][target]; } }