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 str, String pattern)
    {
        int sLen = str.length();
        int pLen = pattern.length();
        int i = 0;
        int j = 0;
        int pStr = -1;
        int pPattern = -1;
        while (i < sLen)
        {
            if (j < pLen && (pattern.charAt(j) == '?' || pattern.charAt(j) == str.charAt(i)))
            {
                i++ ;
                j++ ;
            }
            else if (j < pLen && pattern.charAt(j) == '*')
            {
                pStr = i;
                pPattern = j;
                j++ ;
            }
            else if (pPattern != -1)
            {
                pStr++ ;
                i = pStr;
                j = pPattern + 1;
            }
            else
            {
                return false;
            }
        }
        while (j < pLen && pattern.charAt(j) == '*')
        {
            j++ ;
        }
        return j == pLen;
    }
}