匹配
文章平均质量分 84
jmspan
这个作者很懒,什么都没留下…
展开
-
LeetCode 290. Word Pattern(单词模式)
原题网址:https://leetcode.com/problems/word-pattern/Given a pattern and a string str, find if str follows the same pattern.Here follow means a full match, such that there is a bijection betwee原创 2016-04-16 04:05:13 · 658 阅读 · 0 评论 -
LeetCode 170. Two Sum III - Data structure design(两数和)
原题网址:https://leetcode.com/problems/two-sum-iii-data-structure-design/Design and implement a TwoSum class. It should support the following operations: add and find.add - Add the number to an原创 2016-05-25 01:36:58 · 899 阅读 · 0 评论 -
LeetCode 211. Add and Search Word - Data structure design(单词检索)
原题网址:https://leetcode.com/problems/add-and-search-word-data-structure-design/Design a data structure that supports the following two operations:void addWord(word)bool search(word)search(原创 2016-05-05 01:43:09 · 1233 阅读 · 0 评论 -
LeetCode 18. 4Sum(四数之和)
原题网址:https://leetcode.com/problems/4sum/Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which原创 2016-05-19 06:31:51 · 733 阅读 · 0 评论 -
LeetCode 291. Word Pattern II(单词模式II)
原题网址:https://leetcode.com/problems/word-pattern-ii/Given a pattern and a string str, find if str follows the same pattern.Here follow means a full match, such that there is a bijection bet原创 2016-04-16 04:00:07 · 1206 阅读 · 0 评论 -
LeetCode 10. Regular Expression Matching(正则表达式匹配)
原题网址:https://leetcode.com/problems/regular-expression-matching/Implement regular expression matching with support for '.' and '*'.'.' Matches any single character.'*' Matches zero or more of原创 2016-05-19 05:10:02 · 1497 阅读 · 0 评论 -
LeetCode 44. Wildcard Matching(模糊匹配)
原题网址:https://leetcode.com/problems/wildcard-matching/Implement wildcard pattern matching with support for '?' and '*'.'?' Matches any single character.'*' Matches any sequence of characters (原创 2016-05-21 04:07:39 · 2577 阅读 · 0 评论 -
LeetCode 115. Distinct Subsequences(子序列数量)
原题网址:https://leetcode.com/problems/distinct-subsequences/Given a string S and a string T, count the number of distinct subsequences of T in S.A subsequence of a string is a new string which原创 2016-05-24 00:19:33 · 512 阅读 · 0 评论