LeetCode 97 Interleaving String (动态规划)

class Solution {
public:
    

    bool isInterleave(string s1, string s2, string s3) {
    
    int dp[s3.size()+1][s1.size()+1][s2.size()+1];
    memset(dp,0,sizeof(dp));
    dp[0][0][0]=1;

    for(int i=1;i<=s3.size();i++)
    {
        for(int j=0;j<=s1.size();j++)
        {
            for(int k=0;k<=s2.size();k++)
            {
                if(j!=0 && s3[i-1]==s1[j-1]) {

                    if (dp[i-1][j-1][k]==1)
                        dp[i][j][k] = 1;
                }

                if(k!=0 && s3[i-1]==s2[k-1])
                {
                    if(dp[i-1][j][k-1]==1)
                        dp[i][j][k]=1;

                }
            }

        }

    }

    if(dp[s3.size()][s1.size()][s2.size()]==1)
        return true;
    
    else
        return false;

        
    }
};