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 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++;
                ss = i;
            }
            
            if((j == pLen) || (s.charAt(i) != p.charAt(j) && p.charAt(j) != '?')){
                if(starP < 0){
                    return false;
                } else {
                    j = starP + 1;
                    i = ++ss;
                }
            } else{
                i++;
                j++;
            }
            
            
        }
        while (j < pLen && p.charAt(j) == '*') {
            j++;
        }
        return j == pLen;
    }

http://blog.sina.com.cn/s/blog_b9285de20101gw2x.html

http://yucoding.blogspot.com/2013/02/leetcode-question-123-wildcard-matching.html