首页 > 代码库 > leetcode - Wildcard Matching
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 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
class Solution { public: bool isMatch(const char *s, const char *p) { const char* star=NULL; const char* t=s; while (*s) { if ((*p==‘?‘)||(*p==*s)) { s++; p++; continue; } if (*p==‘*‘) { star=p++; t=s; continue; } if (star) { p = star+1; s=++t; continue; } return false; } while (*p == ‘*‘) { p++; } return !*p; } };
leetcode - Wildcard Matching
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。