leetcode97. 交错字符串

1、题目

https://leetcode-cn.com/problems/interleaving-string/

2、题意

题解1：dp
做法和10正则表达式匹配 72. 编辑距离类似
f[i][j]表示s1前i个字符和s2前j个字符是否可以交错形成s3前i+j个字符
1:s1[i] == s3[i + j] f[i][j] = f[i - 1][j];
2:s2[j] == s3[i + j] f[i][j] = f[i][j-1];
两种情况一种为true则f[i][j] = true;

class Solution {
public:
    bool isInterleave(string s1, string s2, string s3) {
        int n = s1.size(), m = s2.size();
        if (s3.size() != n + m) return false;

        vector<vector<bool>> f(n + 1, vector<bool>(m + 1));
        s1 = ' ' + s1, s2 = ' ' + s2, s3 = ' ' + s3;
        for (int i = 0; i <= n; i ++ )
            for (int j = 0; j <= m; j ++ )
                if (!i && !j) f[i][j] = true;
                else {
                    if (i && s1[i] == s3[i + j]) f[i][j] = f[i - 1][j];
                    if (j && s2[j] == s3[i + j]) f[i][j] = f[i][j] || f[i][j - 1];
                }

        return f[n][m];
    }
};