回溯法
关注
分享
扫一扫
文章平均质量分 84
Zarlove
这个作者很懒，什么都没留下…
展开
-
Leetcode算法学习日志-39 Combination Sum
Leetcode 39 Combination Sum 题目原文 Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. Th原创 2017-10-20 09:21:55 · 286 阅读 · 0 评论 -
Leetcode算法学习日志-78 Subsets
Leetcode 78 Subsets 题目原文 Given a set of distinct integers, nums, return all possible subsets (the power set). Note: The solution set must not contain duplicate subsets. For example, If nums =原创 2017-11-07 19:29:33 · 307 阅读 · 0 评论