Leetcode44. Wildcard Matching

题目：

Given an input string (s) and a pattern (p), 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 the entire input string (not partial).
Note:

s could be empty and contains only lowercase letters a-z.
p could be empty and contains only lowercase letters a-z, and characters like ? or *.

代码（c++）：

class Solution {public:bool isMatch(string s, string p) {//定义两个指针分别指向字符串s以及字符串pint pos_p = 0;//定义一个数组代表最优子问题的当前解vector<bool> dp_cur;dp_cur.push_back(true);for(int i = 0; i < s.length(); i++) dp_cur.push_back(false);//进行动态规划while(pos_p < p.length()) {vector<bool> dp_temp = dp_cur;//出现‘*’的情况if(p[pos_p] == '*') {//遍历for(int i = 0; i < dp_cur.size(); i++) {if(dp_cur[i] == true) {while(i < s.length()) {i++;dp_temp[i] = true;}}}pos_p = pos_p + 1;}//单字符情况else {//遍历for(int i = 0; i < dp_cur.size(); i++) {if(dp_cur[i] == true) {dp_temp[i] = false;while(i < s.length() && dp_cur[i] == true) {if(s[i] == p[pos_p] || p[pos_p] == '?') {i++;dp_temp[i] = true;}else break;}}}pos_p = pos_p + 1;}dp_cur = dp_temp;}if(dp_cur[s.length()] == true) return true;else return false;}
};

Leetcode44. Wildcard Matching相关推荐

leetcode-44. Wildcard Matching
题目阐释: 正则匹配字符串,用程序实现关键理解: 正则匹配,动态规划思想,一个个向后追溯,后面的依赖前面的匹配成功. 正则和待匹配的字符串长度不一,统一到正则字符串的index索引上,每次的字符串i ...
LeetCode44 Wildcard Matching
题目: Implement wildcard pattern matching with support for '?' and '*'. '?' Matches any single charact ...
[LeetCode] Wildcard Matching 题解
6. Wildcard Matching 题目 Implement wildcard pattern matching with support for '?' and '*'. '?' Matche ...
[LintCode] Wildcard Matching
Wildcard Matching Implement wildcard pattern matching with support for '?'and '*'. '?' Matches any s ...
[OJ] Wildcard Matching (Hard)
LintCode 192. Wildcard Matching (Hard) LeetCode 44. Wildcard Matching (Hard) 第二次刷还是被这题虐. 其实就是跪在一个地方, ...
【LeetCode】44. Wildcard Matching (2 solutions)
Wildcard Matching Implement wildcard pattern matching with support for '?' and '*'. '?' Matches any ...
leetcode44:wildcard
44. Wildcard Matching 问题描述给定字符串s和模式p,判断字符串s是否完全符合模式p 其中字符串s只包含小写字母,模式串p包含小写字母.*.?,其中星号表示任意长度的任意字符串, ...
LeetCode - 44. Wildcard Matching
44. Wildcard Matching Problem's Link --------------------------------------------------------------- ...
【To Understand! 重点递归动态规划正则表达式匹配】LeetCode 44. Wildcard Matching
LeetCode 44. Wildcard Matching Solution1:我的答案递归,时间复杂度是O(2n)O(2n)O(2^n)因为超时未能AC 只是记录一下,以警示后人-- class ...
Wildcard Matching 1
Wildcard Matching 题解题目描述即判断字符串与正则表达式(只支持'?'和'*')是否匹配. '?'匹配任意一个字符,'*'匹配任意一个序列. 如:"abab"与 ...

Leetcode44. Wildcard Matching

题目：

代码（c++）：

Leetcode44. Wildcard Matching相关推荐

最新文章

热门文章