子集和数问题，回溯法实现-subset of several problems that back Method

子集和数问题，回溯法实现-subset of several problems that back Method

给定一个正整数的集合,子集和问题要求在这个正整数集合中,找出其和不超过正整数C的最大和数的子集，且设计的算法是基于近似算法的基本思想。-Given a set of positive integers, a subset of the requirements and problems in this set of positive integers, to find out and no more than the largest p

inroduction to algorithms in data structures