97. Interleaving String (String; DP)

Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.

For example,
Given:
s1 = "aabcc",
s2 = "dbbca",

When s3 = "aadbbcbcac", return true.
When s3 = "aadbbbaccc", return false.

class Solution {
public:
    bool isInterleave(string s1, string s2, string s3) {
        //dp[i][j]: s3[i+j-1] can be interleaved by s1[0..i], s2[0..j]
        //dp[i][j] = dp[i-1][j] if s3[i+j-1]==s1[i]
        //            = dp[i][j-1] if s3[i+j-1]==s2[j]
        //so traverse i,j,k from small to large
        int len1 = s1.length();
        int len2 = s2.length();
        if(len1+len2!=s3.length()) return false;
        vector<vector<bool>> dp(len1+, vector<bool>(len2+, false));

        //initial status
        dp[][] = true; //0 means null string
        for(int j = ; j <= len2; j++){
            dp[][j] = dp[][j-] && s2[j-]==s3[j-];
        }
        for(int i = ; i <= len1; i++){
            dp[i][] = dp[i-][] && s1[i-]==s3[i-];
        }

        //state transfer
        for(int i = ; i<= len1; i++){
            for(int j = ; j <= len2; j++){
                dp[i][j] = (dp[i][j-] && s2[j-]==s3[i+j-]) || (dp[i-][j] && s1[i-]==s3[i+j-]);
            }
        }
        return dp[len1][len2];
    }
};