标签：
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
此题目和 Regular Expression Matching 非常相像，但有不一样，可以对比分析
方法一，递归，不过超时了
Last executed input: "babaabbbbbaaaaabbaababbaaaaaaabbaabaabbbabbaabbbbb", "*ba**bbbb
class Solution { public: bool isMatch(const char *s, const char *p) { //cout << "==========" << endl; //cout << "s\t" <<s <<endl; //cout << "p\t" <<p <<endl; if(*s == ‘\0‘) { if(*p == ‘\0‘) return true; while(*p != ‘\0‘) { if(*p != ‘*‘) return false; p++; } // *p == ‘\0‘ now return true; } if(*s == *p || *p == ‘.‘) return isMatch(s+1, p+1); else { if(*p == ‘*‘) { s++; while(*s != ‘\0‘) { if(isMatch(s, p)) return true; else s++; } // *s == ‘\0‘ now return isMatch(s, p); } else return false; } } };
标签：
原文地址：http://www.cnblogs.com/diegodu/p/4286858.html
