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();
        int pLen = p.length();
        char [] ss = s.toCharArray();
        char [] pp = p.toCharArray();
        int str =0, ptr = 0,s1=0,p1=0;
        boolean star = false;
        
        for(;str<sLen;str++,ptr++){
            if(ptr<pLen&&pp[ptr]=='?'){
                continue;
            }
            else if(ptr<pLen&&pp[ptr]=='*'){
                star = true;
                s1 = str;
                p1 = ptr;
                while(p1<pLen && pp[p1]=='*'){
                    p1++;
                }
                if(p1==pLen) return true;
                ptr = p1-1;
                str = s1-1;
            }
            else if(ptr == pLen || pp[ptr]!=ss[str]){
                if(!star)
                    return false;
                s1++;
                ptr = p1-1;
                str = s1-1;
            }
        }
        while(ptr<pLen&&pp[ptr]=='*'){
            ptr++;
        }
        return ptr ==pLen;
    }
}