-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path0097_Interleaving_String.cpp
More file actions
50 lines (46 loc) · 1.73 KB
/
Copy path0097_Interleaving_String.cpp
File metadata and controls
50 lines (46 loc) · 1.73 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include<iostream>
#include<string>
#include<vector>
using namespace std;
class Solution {
public:
bool isInterleave(string s1, string s2, string s3) {
int n1 = s1.size();
int n2 = s2.size();
int n3 = s3.size();
if(n1 + n2 != n3) return false;
vector<vector<bool> > a(n1 + 1, vector<bool>(n2 + 1, false));
a[0][0] = true;
for(int j = 1; j <= n2; j++){
a[0][j] = a[0][j - 1] ? s2[j - 1] == s3[j - 1] : false;
}
for(int i = 1; i <= n1; i++){
a[i][0] = a[i - 1][0] ? s1[i - 1] == s3[i - 1] : false;
}
// a[i][j] = true when
// a[i-1][j]=true && s1[i-1]==s3[i+j-1] or
// a[i][j-1]=true && s2[j-1]==s3[i+j-1]
for(int i = 1; i <= n1; i++){
for(int j = 1; j <= n2; j++){
if((a[i - 1][j] && s3[i + j - 1] == s1[i - 1]) ||
(a[i][j - 1] && s3[i + j - 1] == s2[j - 1]))
a[i][j] = true;
else
a[i][j] = false;
}
}
return a[n1][n2];
}
};
int main(){
Solution solve;
string s1 = "aabcc";
string s2 = "dbbca";
//string s3 = "aadbbcbcac";
string s3 = "aadbbbaccc";
s1 = "bbbbbabbbbabaababaaaabbababbaaabbabbaaabaaaaababbbababbbbbabbbbababbabaabababbbaabababababbbaaababaa";
s2 = "babaaaabbababbbabbbbaabaabbaabbbbaabaaabaababaaaabaaabbaaabaaaabaabaabbbbbbbbbbbabaaabbababbabbabaab";
s3 = "babbbabbbaaabbababbbbababaabbabaabaaabbbbabbbaaabbbaaaaabbbbaabbaaabababbaaaaaabababbababaababbababbbababbbbaaaabaabbabbaaaaabbabbaaaabbbaabaaabaababaababbaaabbbbbabbbbaabbabaabbbbabaaabbababbabbabbab";
std::cout << solve.isInterleave(s1, s2, s3) << std::endl;
return 0;
}