LeetCode OJ 之 Interleaving String

题目：

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.

有字符串s1 , s2 , s3 ， 找出s3是否由s1和s2的片段构成。

思路：

动态规划：

设状态 f[i][j] ，表示 s1的前i个字符和 s2的前j个字符 ，匹配 s3的前i+j个字符 。

状态转移方程如下：
f[i][j] = (s1[i - 1] == s3 [i + j - 1] && f[i - 1][j]) || (s2[j - 1] == s3 [i + j - 1] && f[i][j - 1]);

代码：

class Solution {
public:
    bool isInterleave(string s1, string s2, string s3) 
    {
        if(s3.size() != s1.size() + s2.size())
            return false;
        vector<vector<bool> > f(s1.size() + 1, vector<bool>(s2.size() + 1, false));
        f[0][0] = true;
        //f[i][j] = (s1[i - 1] == s3 [i + j - 1] && f[i - 1][j]) || (s2[j - 1] == s3 [i + j - 1] && f[i][j - 1]);
        //第1列
        for(size_t i = 1 ; i <= s1.size() ; i++)
        {
            f[i][0] = f[i-1][0] && s1[i-1] == s3[i-1];
        }
        //第一行
        for(size_t i = 1 ; i <= s2.size() ; i++)
        {
            f[0][i] = f[0][i-1] && s2[i-1] == s3[i-1];
        }
        for(size_t i = 1 ; i <= s1.size() ; i++)
        {
            for(size_t j = 1 ; j <= s2.size() ; j++)
            {
                f[i][j] = (s1[i-1] == s3[i+j-1] && f[i-1][j]) || (s2[j-1] == s3[i+j-1] && f[i][j-1]);
            }
        }
        return f[s1.size()][s2.size()];
    }
};