字符串通配符匹配*,?算法

Implement wildcard pattern matching with support for '?' and '*'.

Java Solution

To understand this solution, you can use s="aab" and p="*ab".

public boolean isMatch(String s, String p) {
	int i = 0;
	int j = 0;
	int starIndex = -1;
	int iIndex = -1;
 
	while (i < s.length()) {
		if (j < p.length() && (p.charAt(j) == '?' || p.charAt(j) == s.charAt(i))) {
			++i;
			++j;
		} else if (j < p.length() && p.charAt(j) == '*') {
			starIndex = j;		
			iIndex = i;
			j++;//'*' can match 0 or above 0 characters
		} else if (starIndex != -1) {
                       //such as "abggggb","*b"  
                       //so every time matching starts form the fisrt index of *
                       //can avoid the case above
                        j = starIndex + 1;
			i = iIndex+1;
			iIndex++;
		} else {
			return false;
		}
	}
 
	while (j < p.length() && p.charAt(j) == '*') {
		++j;
	}
 
	return j == p.length();
}