子序列问题

input arr={10, 7, 5, 18, 12, 20, 15} sum =35 output:所有等于sum的子序列 {10, 7, 18} {10, 5, 20} {5, 18, 12} {20, 15} algorithm subsetSum(arr,subarr,n,subSize,total,node,sum) n是arr的大小，subSize是subarr的大小(个数）,t

>>阅读原文<<