[LeetCode] #44 Wildcard Matching

mplement 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).The function prototype should be:
bool isMatch(const char *s, const char *p)Some examples:
isMatch("aa","a") → false
isMatch("aa","aa") → true
isMatch("aaa","aa") → false
isMatch("aa", "*") → true
isMatch("aa", "a*") → true
isMatch("ab", "?*") → true
isMatch("aab", "c*a*b") → false

本题是匹配问题，如果遇到‘？’就匹配任意一个字符，如果是‘*’，匹配0-n个字符。利用贪心算法求解。时间：20ms。代码如下：

class Solution {
public:bool isMatch(string s, string p) {if (p.empty()) return s.empty();string::const_iterator pter = p.begin(), ster = s.begin();string::const_iterator star_p, star_s;bool sign = false;while (ster!=s.end()){if (pter == p.end()){if (sign){ster = ++star_s;pter = star_p;}elsebreak;}else if (*pter == '?' || *pter == *ster)++pter, ++ster;else if (*pter == '*'){while (pter != p.end() && (*pter == '*' || *pter == '?')){if (*pter == '?'){++pter;++ster;if (ster == s.end())break;}else++pter;}if (pter==p.end()) return true;star_p = pter;star_s = ster;sign = true;}else if ((*pter != *ster || *pter!='?') && sign){ster = ++star_s;pter = star_p; }elsereturn false;}if (ster != s.end())return false;while (pter!=p.end())if (*pter++ != '*')return false;return true;}
};

转载于:https://www.cnblogs.com/Scorpio989/p/4584571.html

[LeetCode] #44 Wildcard Matching相关推荐

【To Understand! 重点递归动态规划正则表达式匹配】LeetCode 44. Wildcard Matching
LeetCode 44. Wildcard Matching Solution1:我的答案递归,时间复杂度是O(2n)O(2n)O(2^n)因为超时未能AC 只是记录一下,以警示后人-- class ...
LeetCode: 44. Wildcard Matching
LeetCode: 44. Wildcard Matching 题目描述 Implement wildcard pattern matching with support for '?' and '* ...
LeetCode - 44. Wildcard Matching
44. Wildcard Matching Problem's Link --------------------------------------------------------------- ...
[leetcode 44] Wildcard Matching
Implement wildcard pattern matching with support for '?' and '*'. '? ' Matches any single character. ...
LeetCode 10. Regular Expression Matching / 44. Wildcard Matching
10. Regular Expression Matching 经典DP题目,比较复杂,需要多复习. dp[i][j] 表示 s 下标0~i,p 下标0~j 是否能够匹配 dp[i-1][j-1] ...
【LeetCode】44. Wildcard Matching (2 solutions)
Wildcard Matching Implement wildcard pattern matching with support for '?' and '*'. '?' Matches any ...
44. Wildcard Matching 通配符匹配
Title 给定一个字符串 (s) 和一个字符模式 § ,实现一个支持 '?' 和 '*' 的通配符匹配. '?' 可以匹配任何单个字符. '*' 可以匹配任意字符串(包括空字符串). 两个字符串完全 ...
[OJ] Wildcard Matching (Hard)
LintCode 192. Wildcard Matching (Hard) LeetCode 44. Wildcard Matching (Hard) 第二次刷还是被这题虐. 其实就是跪在一个地方, ...
[LeetCode] Wildcard Matching 题解
6. Wildcard Matching 题目 Implement wildcard pattern matching with support for '?' and '*'. '?' Matche ...

[LeetCode] #44 Wildcard Matching

[LeetCode] #44 Wildcard Matching相关推荐

最新文章

热门文章