DFS
sysu_xiamengyou
这个作者很懒,什么都没留下…
展开
-
[LeetCode OJ]Combination Sum I && II
【问题描述】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.The same repeated number ma原创 2017-03-09 21:07:43 · 339 阅读 · 0 评论 -
[LeetCode OJ]Triangle
问题描述:Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2],原创 2017-05-05 13:51:59 · 416 阅读 · 0 评论