![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
backtracking
文章平均质量分 71
伊萨卡钢琴家
这个作者很懒,什么都没留下…
展开
-
Leetcode 301. Remove Invalid Parentheses
Remove the minimum number of invalid parentheses in order to make the input string valid. Return all possible results. Note: The input string may contain letters other than the parentheses ( and ).原创 2016-01-21 13:42:31 · 468 阅读 · 0 评论 -
Leetcode 78. Subsets
Given a set of distinct integers, nums, return all possible subsets. Analysis, just to use the former result and then add some elements to the result set. public class Solution { public List>原创 2016-01-23 14:37:30 · 203 阅读 · 0 评论 -
DFS + BackTracking
这是Leetcode经典系列题,就是考对于DFS的理解,确实有技术含量 想上来Combination上来热一下身,如何回溯。就是加1,减1 然后是Combination sum1 combination sum2 combination sum3 然后是Permutation permutation2 http://www.shuati原创 2016-02-14 12:00:28 · 417 阅读 · 0 评论