Wildcard Matching

最新推荐文章于 2019-01-11 22:17:19 发布

Paul_ZJ

最新推荐文章于 2019-01-11 22:17:19 发布

阅读量536

点赞数

分类专栏： LeetCode——坚持每天一题

本文链接：https://blog.csdn.net/shuitawuhen/article/details/43232135

版权

LeetCode——坚持每天一题专栏收录该内容

176 篇文章 0 订阅

订阅专栏

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

Java代码：

public class Solution {
    public boolean isMatch(String s, String p) {
        int ss=0,pp=0;
            int marked = -1;
            String p2 = p+'^'; // In case that the last char in p is *

            while(ss<s.length() && pp<p2.length()){
                if(s.charAt(ss) == p2.charAt(pp) || p2.charAt(pp)=='?'){
                    ss++;
                    pp++;
                }
                else if(p2.charAt(pp)=='*'){
                    pp++;
                    marked = pp;
                }
                else{
                    if(pp==marked){
                        ss++;
                    }
                    else{
                        if(marked!=-1){ 
                            ss = ss - (pp - marked - 1);
                            pp = marked;
                        }
                        else return false;
                    }
                }
            }

            while(pp<p.length()){
                if(p.charAt(pp)!='*'){
                    return false;
                }
                pp++;
            }
            return ss>=s.length();
    }
}