2015年11月
[LintCode] Wildcard Matching
摘要： Wildcard MatchingImplement wildcard pattern matching with support for'?'and'*'.'?'Matches any single character.'*'Matches any sequence of characters (... 阅读全文
posted @ 2015-11-11 23:47 Tri_tri_tri 阅读(175) 评论(0) 推荐(0)
[LintCode] Interleaving String
摘要： Interleaving StringGiven three strings:s1,s2,s3, determine whethers3is formed by the interleaving ofs1ands2.ExampleFor s1 ="aabcc", s2 ="dbbca"When s3... 阅读全文
posted @ 2015-11-11 11:14 Tri_tri_tri 阅读(153) 评论(0) 推荐(0)
[LintCode] Distinct Subsequences
摘要： Distinct SubsequencesGiven a stringSand a stringT, count the number of distinct subsequences ofTinS.A subsequence of a string is a new string which is... 阅读全文
posted @ 2015-11-11 10:21 Tri_tri_tri 阅读(127) 评论(0) 推荐(0)
[LintCode] Longest Common Substring
摘要： Longest Common SubstringGiven two strings, find the longest common substring.Return the length of it.ExampleGiven A ="ABCD", B ="CBCE", return2.NoteTh... 阅读全文
posted @ 2015-11-11 04:40 Tri_tri_tri 阅读(153) 评论(0) 推荐(0)
[LintCode] Longest Common Subsequence
摘要： Longest Common SubsequenceGiven two strings, find the longest common subsequence (LCS).Your code should return the length ofLCS.ExampleFor"ABCD"and"ED... 阅读全文
posted @ 2015-11-11 04:20 Tri_tri_tri 阅读(149) 评论(0) 推荐(0)
[LintCode] Edit Distance
摘要： Edit DistanceGiven two wordsword1andword2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)... 阅读全文
posted @ 2015-11-11 03:36 Tri_tri_tri 阅读(155) 评论(0) 推荐(0)
[LintCode] Palindrome Partitioning II
摘要： Palindrome Partitioning IIGiven a strings, cutsinto some substrings such that every substring is a palindrome.Return the minimum cuts needed for a pal... 阅读全文
posted @ 2015-11-11 01:08 Tri_tri_tri 阅读(136) 评论(0) 推荐(0)
[LintCode] Longest Increasing Continuous subsequence II
摘要： Longest Increasing Continuous subsequence IIGive you an integer matrix (with row size n, column size m)，find the longest increasing continuous subsequ... 阅读全文
posted @ 2015-11-10 10:36 Tri_tri_tri 阅读(166) 评论(0) 推荐(0)
[Lintcode] Word Break
摘要： Word BreakGiven a string s and a dictionary of words dict, determine if s can be break into a space-separated sequence of one or more dictionary words... 阅读全文
posted @ 2015-11-10 02:28 Tri_tri_tri 阅读(284) 评论(0) 推荐(0)
[Lintcode] triangle && 动态规划总结
摘要： TriangleGiven a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.ExampleFor example... 阅读全文
posted @ 2015-11-09 12:53 Tri_tri_tri 阅读(297) 评论(0) 推荐(0)