leetcode backtracking
proudmore
这个作者很懒,什么都没留下…
展开
-
Leetcode 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原创 2015-03-25 05:00:06 · 155 阅读 · 0 评论 -
Leetcode Wildcard matching
Implement wildcard pattern matching with support for ‘?’ and ‘*’. ‘?’ Matches any single character. ‘*’ Matches any sequence of characters (including the empty sequence). The matching should cover原创 2015-03-25 13:55:32 · 174 阅读 · 0 评论 -
Leetcode Word break I, II
Word break I 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 example, given s = “leetcode”原创 2015-03-31 14:08:57 · 140 阅读 · 0 评论 -
Leetcode Combination sum III
Find 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 within原创 2015-06-02 12:19:39 · 165 阅读 · 0 评论 -
Leetcode letter combination of a phone number
public class Solution { public List<String> letterCombinations(String digits) { list=new ArrayList<String>(); if(digits.length()==0)return list; StringBuffer path=new String原创 2015-06-09 08:38:10 · 173 阅读 · 0 评论