码迷,mamicode.com
首页 > 其他好文 > 详细

leetcode[44]Wildcard Matching

时间:2015-02-10 14:40:11      阅读:165      评论:0      收藏:0      [点我收藏+]

标签:

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 *ss=NULL;
     const char *pp=NULL;
     while(*s!=\0)
     {
         if(*p==*s||*p==?)
         {
             s++;
             p++;
             continue;
         }
         if(*p==*)
         {
             pp=p;
             ss=s;
              p++;
              continue;
         }
         if(pp!=\0)
         {
             s=ss+1;
             p=pp+1;
             ss++;
             continue;
         }
         return false;
     }
     while(*p==*)p++;
     return *p==\0;
    }
};

 

leetcode[44]Wildcard Matching

标签:

原文地址:http://www.cnblogs.com/Vae98Scilence/p/4283570.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!