![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
深度优先搜索
yimi1995
这个作者很懒,什么都没留下…
展开
-
40. Combination Sum II---找出和为target的子数组
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each number in C may only be used once in the combinati原创 2017-06-19 15:28:02 · 1344 阅读 · 0 评论 -
101. Symmetric Tree--判断是否为对称树
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \3 4 4 3原创 2017-06-20 16:26:29 · 327 阅读 · 0 评论