回溯
文章平均质量分 66
Bryan要加油
这个作者很懒,什么都没留下…
展开
-
Combination Sum II
class Solution {public: vector > combinationSum2(vector &num, int target) { sort(num.begin(), num.end()); vector > ret; vector cur; Helper(ret, cur, num, target, 0原创 2015-04-22 16:10:31 · 346 阅读 · 0 评论 -
22.Generate Parentheses&n对括号的全部有效组合
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:"((()))", "(()())", "(())()", "()(())", "()()原创 2015-06-05 15:51:52 · 888 阅读 · 0 评论 -
60. Permutation Sequence&字符串排列&8.7Permutations without Dups
The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie, for n = 3):"123""132""213""231""3原创 2015-04-28 23:02:46 · 580 阅读 · 0 评论 -
BackTracking
78. SubsetsProblemGiven 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.原创 2016-05-18 11:10:57 · 385 阅读 · 0 评论 -
17. 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.Input:Digit st原创 2015-06-05 10:37:02 · 586 阅读 · 0 评论 -
90. Subsets II
Given a collection of integers that might contain duplicates, S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not contain duplica原创 2014-03-05 17:24:35 · 923 阅读 · 0 评论 -
39. 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 num原创 2015-06-08 21:01:29 · 509 阅读 · 0 评论 -
216. Combination Sum III
QuestionFind all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.Ensure that numbers原创 2016-04-13 10:35:33 · 430 阅读 · 0 评论 -
字符串的排列
题目描述输入一个字符串,按字典序打印出该字符串中字符的所有排列。例如输入字符串abc,则打印出由字符a,b,c所能排列出来的所有字符串abc,acb,bac,bca,cab和cba。 结果请按字母顺序输出。 输入描述: 输入一个字符串,长度不超过9(可能有字符重复),字符只包括大小写字母。解答求字符串的全排列,偷懒用了库函数class Solution {public: vector原创 2016-02-29 21:22:52 · 255 阅读 · 0 评论 -
51.N-Queens&n皇后问题
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, return all distinct solutions to the n-queens puzzle.Eac原创 2015-06-24 16:59:45 · 485 阅读 · 0 评论 -
10. Regular Expression Matching&正则表达式匹配
题目描述请实现一个函数用来匹配包括’.’和’‘的正则表达式。模式中的字符’.’表示任意一个字符,而’‘表示它前面的字符可以出现任意次(包含0次)。 在本题中,匹配是指字符串的所有字符匹配整个模式。例如,字符串”aaa”与模式”a.a”和”ab*ac*a”匹配,但是与”aa.a”和”ab*a”均不匹配。解答 每次从字符串中拿出一个字符和模式串中的字符去匹配。 首先分析符合匹配任意字符。如果模式原创 2016-02-27 09:55:09 · 759 阅读 · 0 评论 -
机器人的运动范围
题目描述地上有一个m行和n列的方格。一个机器人从坐标0,0的格子开始移动,每一次只能向左,右,上,下四个方向移动一格,但是不能进入行坐标和列坐标的数位之和大于k的格子。 例如,当k为18时,机器人能够进入方格(35,37),因为3+5+3+7 = 18。但是,它不能进入方格(35,38),因为3+5+3+8 = 19。请问该机器人能够达到多少个格子?解答与79. Word Search&矩阵中的路径原创 2016-03-07 14:58:34 · 484 阅读 · 0 评论 -
79. Word Search&矩阵中的路径
题目描述请设计一个函数,用来判断在一个矩阵中是否存在一条包含某字符串所有字符的路径。路径可以从矩阵中的任意一个格子开始,每一步可以在矩阵中向左,向右,向上,向下移动一个格子。如果一条路径经过了矩阵中的某一个格子,则该路径不能再进入该格子。 例如上图的3*4矩阵中包含一条字符串”bcced”的路径,但是矩阵中不包含”abcb”路径,因为字符串的第一个字符b占据了矩阵中的第一行第二个格子之后,路径原创 2016-03-07 09:53:17 · 565 阅读 · 0 评论 -
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原创 2015-06-08 21:03:37 · 602 阅读 · 0 评论 -
93.Restore IP Addresses
Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given "25525511135",return ["255.255.11.135", "255.255.111.35"]. (Order原创 2015-06-30 11:08:44 · 604 阅读 · 0 评论 -
Regular Expression Matching
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原创 2015-06-04 19:42:01 · 558 阅读 · 0 评论 -
N-Queens II
Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.Hide Tags Backtrackingdddclass So原创 2015-06-24 17:06:40 · 337 阅读 · 0 评论 -
Sudoku Solver
Write a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character '.'.You may assume that there will be only one unique solution.A sudoku原创 2015-04-28 23:17:32 · 384 阅读 · 0 评论 -
78. Subsets&集合的子集&Power Set
Given 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 not contain duplicate subsets.For example,原创 2014-03-05 11:49:29 · 949 阅读 · 0 评论