leetcode2sumc-CTCI:CTCI

leetcode 2 和 c CTCI 回溯总结： 组合和、子集、排列、回文） 组合和 def combinationSum ( self , candidates , target ): def backtrack ( tmp , start , end , target ): if target == 0 : ans . append ( tmp [:]) elif target > 0 : for i in range ( start , end ): tmp . append ( candidates [ i ]) backtrack ( tmp , i , end , target - candidates [ i ]) tmp . pop () ans = [] candidates . sort ( reverse = True ) backtrack ([], 0 , len ( candidates ), target ) return ans 组合和II def combinationSum2 ( self , candidates , target ): def