backtracking
文章平均质量分 65
Yingying_code
这个作者很懒,什么都没留下…
展开
-
401. Binary Watch*
A binary watch has 4 LEDs on the top which represent the hours (0-11), and the 6 LEDs on the bottom represent the minutes (0-59).Each LED represents a zero or one, with the least significant bit o原创 2017-01-14 00:03:16 · 267 阅读 · 0 评论 -
113. Path Sum II**
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree and sum = 22, 5 / \原创 2017-02-08 21:03:10 · 243 阅读 · 0 评论 -
131. 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[ ["aa","b"],原创 2017-01-15 00:05:15 · 236 阅读 · 0 评论 -
77. Combinations**
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:[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4],]原创 2017-01-14 23:55:15 · 256 阅读 · 0 评论 -
40. Combination Sum II**
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 combina原创 2017-01-14 23:42:43 · 198 阅读 · 0 评论 -
39. Combination Sum**
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 may be chosen原创 2017-01-14 23:25:32 · 229 阅读 · 0 评论 -
90. Subsets II**
Given a collection of integers that might contain duplicates, nums, return all possible subsets.Note: The solution set must not contain duplicate subsets.For example,If nums = [1,2,2], a原创 2017-01-14 22:07:39 · 236 阅读 · 0 评论 -
78. Subsets**
Given a set of distinct integers, nums, return all possible subsets.Note: The solution set must not contain duplicate subsets.For example,If nums = [1,2,3], a solution is:[ [3], [1],原创 2017-01-14 21:58:16 · 307 阅读 · 0 评论 -
47. Permutations II**
Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2] have the following unique permutations:[ [1,1,2], [1,2,1], [2,1原创 2017-01-14 21:38:15 · 208 阅读 · 0 评论 -
46. Permutations**
Given a collection of distinct numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1原创 2017-01-14 21:09:22 · 268 阅读 · 0 评论 -
89. Gray Code**
The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, print the sequence of原创 2017-01-14 00:17:59 · 224 阅读 · 0 评论 -
491. Increasing Subsequences**
Given an integer array, your task is to find all the different possible increasing subsequences of the given array, and the length of an increasing subsequence should be at least 2 .Example:In原创 2017-01-23 18:23:53 · 770 阅读 · 0 评论