97. Interleaving String

我现在一做到字符串匹配，dp就完事儿了，感觉不难

class Solution {
public:
	bool dp[1000][1000];
	bool isInterleave(string s1, string s2, string s3) {
        if(s1.length()+s2.length()!=s3.length())return false;
		dp[0][0] = true;
		dp[1][0] = s1[0] == s3[0] ? true : false;
		dp[0][1] = s2[0] == s3[0] ? true : false;
		for (int i = 0; i <= s1.length(); ++i) {
			for (int j = 0; j <= s2.length(); ++j) {
                if(i==0&&j==0)continue;
				dp[i][j] = (i>0&&dp[i - 1][j] && s1[i-1] == s3[i + j-1]) ||
					(j>0&&dp[i][j - 1] && s2[j-1] == s3[i + j-1]);
			}
		}
		return dp[s1.length()][s2.length()];
	}
};