leetcode 97

给定三个字符串 s1, s2, s3, 验证 s3 是否是由 s1 和 s2 交错组成的。

示例 1:

输入: s1 = "aabcc", s2 = "dbbca", s3 = "aadbbcbcac"
输出: true

示例 2:

输入: s1 = "aabcc", s2 = "dbbca", s3 = "aadbbbaccc"
输出: false

 

纯递归暴力…  有一个优化点是减少重复递归次数,加一层dp缓存或者哈西一个数值做dp值就可以了。

static const auto _=[](){
    std::ios::sync_with_stdio(false);
    cin.tie(nullptr);
    return nullptr;
}();

class Solution {
public:
    bool gao(string& s1, string& s2, string& s3, int l1, int l2, int l3) {
        if (l1 == s1.length() && l2 >= s2.length() && l3 == s3.length()) {
            return true;
        }
        if (l1 < s1.length() && l2 < s2.length()) {
            if (s1[l1] == s3[l3] && s2[l2] == s3[l3]) {
                return gao(s1, s2, s3, l1 + 1, l2, l3 + 1) || gao(s1, s2, s3, l1, l2 + 1, l3 + 1);
            } else if (s1[l1] == s3[l3]) {
                return gao(s1, s2, s3, l1 + 1, l2, l3 + 1);
            } else if (s2[l2] == s3[l3]) {
                return gao(s1, s2, s3, l1, l2 + 1, l3 + 1);
            } else {
                return false;
            }
        } else if (l1 < s1.length()) {
            if (s1[l1] == s3[l3]) {
                return gao(s1, s2, s3, l1 + 1, l2, l3 + 1);
            } else {
                return false;
            }
        } else if (l2 < s2.length()) {
            if (s2[l2] == s3[l3]) {
                return gao(s1, s2, s3, l1, l2 + 1, l3 + 1);
            } else {
                return false;
            }
        } else if (l1 == s1.length() && l2 == s2.length()) {
            return true;
        } else {
            return false;
        }
    }
    bool isInterleave(string s1, string s2, string s3) {
        if(s1.length() + s2.length() != s3.length()) {
            return false;
        }
        return gao(s1, s2, s3, 0, 0, 0);
    }
};