/
Solution.java
executable file
·71 lines (56 loc) · 2.13 KB
/
Solution.java
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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
public class Solution {
public boolean isInterleave(String s1, String s2, String s3) {
char[] S1 = s1.toCharArray();
char[] S2 = s2.toCharArray();
char[] S3 = s3.toCharArray();
if(S1.length + S2.length != S3.length) return false;
boolean[][] dp = new boolean[S1.length+1][S2.length+1];
for(int i = 0; i < S1.length+1; i++){
for(int j = 0; j < S2.length+1; j++){
if(i == 0 && j == 0){
dp[i][j] = true;
}else if(i == 0){
dp[i][j] = dp[i][j-1] && S2[j-1] == S3[i+j-1];
}else if(j == 0){
dp[i][j] = dp[i-1][j] && S1[i-1] == S3[i+j-1];
}else{
dp[i][j] = (dp[i][j-1] && S2[j-1] == S3[i+j-1]) ||
(dp[i-1][j] && S1[i-1] == S3[i+j-1]);
}
}
}
return dp[S1.length][S2.length];
}
}
public class Solution {
public boolean isInterleave(String s1, String s2, String s3) {
char[] S1 = s1.toCharArray();
char[] S2 = s2.toCharArray();
char[] S3 = s3.toCharArray();
if(S1.length + S2.length != S3.length) return false;
int i;
int j;
boolean[][] map = new boolean[S1.length + 1][S2.length + 1];
// i -> s1, j -> s2
map[0][0] = true;
for(i = 1; i <= S1.length; i++){
map[i][0] = map[i - 1][0] && S1[i - 1] == S3[i - 1];
}
for(j = 1; j <= S2.length; j++){
map[0][j] = map[0][j - 1] && S2[j - 1] == S3[j - 1];
}
for(i = 1; i <= S1.length; i++){
for(j = 1; j <= S2.length; j++){
if(map[i - 1][j]){
map[i][j] = S3[i + j - 1] == S1[i - 1];
continue;
}
if(map[i][j - 1]){
map[i][j] = S3[i + j - 1] == S2[j - 1];
continue;
}
}
}
return map[S1.length][S2.length];
}
}