2016年4月5日
摘要：
Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words. For 阅读全文
posted @ 2016-04-05 18:25
Beserious
阅读(243)
评论(0)
推荐(0)
摘要：
Given a collection of integers that might contain duplicates, nums, return all possible subsets. Note: Elements in a subset must be in non-descending 阅读全文
posted @ 2016-04-05 18:23
Beserious
阅读(132)
评论(0)
推荐(0)
摘要：
Given a set of distinct integers, nums, return all possible subsets. Note: Elements in a subset must be in non-descending order. The solution set must 阅读全文
posted @ 2016-04-05 18:22
Beserious
阅读(178)
评论(0)
推荐(0)
摘要：
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example,If n = 4 and k = 2, a solution is: 阅读全文
posted @ 2016-04-05 18:21
Beserious
阅读(144)
评论(0)
推荐(0)
摘要：
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 num 阅读全文
posted @ 2016-04-05 16:55
Beserious
阅读(162)
评论(0)
推荐(0)
摘要：
Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The same repeat 阅读全文
posted @ 2016-04-05 16:52
Beserious
阅读(202)
评论(0)
推荐(0)
摘要：
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: " 阅读全文
posted @ 2016-04-05 16:49
Beserious
阅读(206)
评论(0)
推荐(0)
浙公网安备 33010602011771号