Wildcard Matching

这几天过的很混沌，但又。。。但愿是好的，我们的美好，像郭靖一样：坚持，努力。

参考：点击打开链接

之所以有这一行：

idmatch++;是因为idmatch的位置已经match了
public class Solution {
public boolean isMatch(String s, String p) {
int ids = 0, idp = 0, idstart = -1, idmatch = 0;
while (ids < s.length()) {
if (idp < p.length() && (s.charAt(ids) == p.charAt(idp) || p.charAt(idp) == '?')) {
ids++;
idp++;
} else if (idp < p.length() && p.charAt(idp) == '*') {
idstart = idp;
idp++;
idmatch = ids;
} else if (idstart != -1) {
idp = idstart + 1;
idmatch++;
ids = idmatch;
} else {
return false;
}
}
while (idp < p.length() && p.charAt(idp) == '*') {
idp++;
}
return idp == p.length();
}
}

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