DFS
文章平均质量分 58
益达915
一名在读大学生,渣渣一枚,进取中...
展开
-
LeetCode | Palindrome Partitioning I,II
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”], [“a”,”原创 2016-08-15 18:50:44 · 236 阅读 · 0 评论 -
LeetCode | Unique Paths I,II
A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below). The robot can only move either down or right at any point in time. The robot is trying to reach the b原创 2016-08-15 22:25:42 · 274 阅读 · 0 评论 -
LeetCode | N-Queens I,II
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.Each s原创 2016-08-16 17:05:15 · 241 阅读 · 0 评论 -
LeetCode | 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 does not原创 2016-08-16 17:56:39 · 239 阅读 · 0 评论 -
LeetCode | Combination Sum I,II
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 number of t原创 2016-08-16 21:08:03 · 273 阅读 · 0 评论 -
LeetCode | Word Break II
Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences. For example, given s = "原创 2016-08-27 11:51:48 · 519 阅读 · 0 评论 -
LeetCode | Generate Parentheses
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:[ “((()))”, “(()())”, “(())()”, “()(())”,原创 2016-08-19 11:29:19 · 206 阅读 · 0 评论 -
LeetCode | Sudoku Solver
You may assume that there will be only one unique solution. A sudoku puzzle… …and its solution numbers marked in red.数独问题,暴力深搜。 注意在找到解之后,要及时return,以及在第某一行无解的时候,要及时return,这样剪枝才不会导致超时。class Solution {原创 2016-08-19 15:46:13 · 230 阅读 · 0 评论 -
LeetCode | Word Search
Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where “adjacent” cells are those horizontally or vertically neig原创 2016-08-19 16:25:07 · 173 阅读 · 0 评论