![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
回溯
文章平均质量分 78
sscssz
这个作者很懒,什么都没留下…
展开
-
【VIP】【leetcode题解】【回溯】【97.5】【M】Subsets
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 not contain duplicate subsets.For原创 2015-12-15 13:46:41 · 318 阅读 · 0 评论 -
【回溯】【leetcode题解】【M】【57】Combination Sum
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 repeated number may be chosen from C unlimited numbe原创 2015-12-15 18:37:56 · 408 阅读 · 0 评论 -
【leetcode题解】【回溯】【54】【M】Subsets II
Given a collection of integers that might contain duplicates, nums, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not contain du原创 2015-12-15 20:01:12 · 448 阅读 · 0 评论 -
【leetcode题解】【M】【79】Palindrome Partitioning
Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example, given s = "aab",Return [ [原创 2015-12-18 23:54:35 · 268 阅读 · 0 评论 -
【leetcode题解】【M】【67】Letter Combinations of a Phone Number
Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.原创 2015-12-18 23:56:24 · 273 阅读 · 0 评论 -
【VIP】【图】332. Reconstruct Itinerary【M】【47】
Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the tickets belong to a man who departs from JFK. Thus,原创 2016-03-29 19:44:09 · 436 阅读 · 0 评论 -
10. Regular Expression Matching【H】【87】【vip】【再来一遍】
Implement regular expression matching with support for '.' and '*'.'.' Matches any single character.'*' Matches zero or more of the preceding element.The matching should cover the entire input st原创 2016-05-28 16:10:58 · 417 阅读 · 0 评论 -
【LeetCode】526. Beautiful Arrangement【M】【35】【回溯】
Suppose you have N integers from 1 to N. We define a beautiful arrangement as an array that is constructed by these N numbers successfully if one of the following is true for the ith position (1 ≤ i原创 2017-03-31 13:23:39 · 823 阅读 · 0 评论