44. Wildcard Matching

DP真的好难受。。这道题一开始用的递归，最后发现严重超时，只能去看题解，用的递归，还是一知半解，很难体会感觉

class Solution {
public:
	bool isMatch(string s, string p) {
		int m = s.size(), n = p.size();
		vector<vector<bool>>dp(m + 1, vector<bool>(n + 1, false));
		dp[0][0] = true;
		for (int i = 1; i <= n; ++i) {
			if (p[i - 1] == '*')dp[0][i] = dp[0][i - 1];
		}
		for (int i = 1; i <= m; ++i) {
			for (int j = 1; j <= n; ++j) {
				if (p[j - 1] == '*')dp[i][j] = dp[i - 1][j] || dp[i][j - 1];
				else dp[i][j] = (s[i - 1] == p[j - 1] || p[j - 1] == '?') && dp[i - 1][j - 1];
			}
		}
		return dp[m][n];
	}
};