2014年12月29日
【leetcode】Simplify Path
摘要： Simplify PathGiven an absolute path for a file (Unix-style), simplify it.For example,path="/home/", =>"/home"path="/a/./b/../../c/", =>"/c"click to sh... 阅读全文
posted @ 2014-12-29 21:24 H5开发技术 阅读(234) 评论(0) 推荐(0)
【leetcode】Generate Parentheses
摘要： Generate ParenthesesGivennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, givenn= 3, a sol... 阅读全文
posted @ 2014-12-29 21:23 H5开发技术 阅读(131) 评论(0) 推荐(0)
【leetcode】Combination Sum II
摘要： Combination Sum IIGiven a collection of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sum... 阅读全文
posted @ 2014-12-29 21:22 H5开发技术 阅读(187) 评论(0) 推荐(0)
【leetcode】Combination Sum
摘要： Combination SumGiven a set of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Thes... 阅读全文
posted @ 2014-12-29 21:20 H5开发技术 阅读(148) 评论(0) 推荐(0)
【leetcode】Subsets II
摘要： Subsets IIGiven a collection of integers that might contain duplicates,S, return all possible subsets.Note:Elements in a subset must be in non-descend... 阅读全文
posted @ 2014-12-29 21:19 H5开发技术 阅读(175) 评论(0) 推荐(0)
【leetcode】Subsets
摘要： SubsetsGiven a set of distinct integers,S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must... 阅读全文
posted @ 2014-12-29 21:18 H5开发技术 阅读(145) 评论(0) 推荐(0)
【leetcode】Letter Combinations of a Phone Number
摘要： Letter Combinations of a Phone NumberGiven a digit string, return all possible letter combinations that the number could represent.A mapping of digit ... 阅读全文
posted @ 2014-12-29 21:17 H5开发技术 阅读(175) 评论(0) 推荐(0)