📜  子总和问题的C程序| DP-25

📅  最后修改于: 2021-05-28 05:06:52             🧑  作者: Mango

给定一组非负整数和一个值sum ,确定给定集合的子集是否等于sum等于给定sum
例子:

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