【从0到1冲刺蓝桥杯国赛】每日一练——交错字符串

交错字符串https://leetcode-cn.com/problems/interleaving-string/

 题目描述：

思路分析： 

leetcode题解： 

class Solution {public:    bool isInterleave(string s1, string s2, string s3) { auto f = vector < vector  > (s1.size() + 1, vector  (s2.size() + 1, false)); int n = s1.size(), m = s2.size(), t = s3.size(); if (n + m != t) {     return false; } f[0][0] = true; for (int i = 0; i <= n; ++i) {     for (int j = 0; j  0) {      f[i][j] |= (f[i - 1][j] && s1[i - 1] == s3[p]);  }  if (j > 0) {      f[i][j] |= (f[i][j - 1] && s2[j - 1] == s3[p]);  }     } } return f[n][m];    }};