JavaScript:实现子集数的总和等于给定的数算法
function NumberOfSubsetSum (array, sum) {
const dp = [] // create an dp array where dp[i] denote number of subset with sum equal to i
for (let i
function NumberOfSubsetSum (array, sum) {
const dp = [] // create an dp array where dp[i] denote number of subset with sum equal to i
for (let i