[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

 

public class Solution {
   public boolean isMatch(String s, String p) {
        int slen = s.length(), plen = p.length();
        int i =0, j =0;
        int ss =0, starP =- 1;
        while(i < slen){
            
            while( j < plen && p.charAt(j) == '*'){
                starP = j ;
                j++;
                ss = i;
            }
            
            if(j<plen&&((s.charAt(i) == p.charAt(j) || p.charAt(j) == '?'))){
                i++;
                j++;
            }else {
                if(starP < 0){
                    return false;
                }else{
                    j = starP + 1;
                    i = ++ss;
                }
                
            }
        }
        
        
        while( j < plen && p.charAt(j) == '*'){
            j++;
        }
        
        return j == plen;
    }
}