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
| class Solution {
public boolean isSubsequence(String s, String t) {
int n1 = s.length();
int n2 = t.length();
boolean[][] dp = new boolean[n1 + 1][n2 + 1];
for (int i = 1; i <= n1; i++) {
dp[i][0] = false;
}
for (int i = 0; i <= n2; i++) {
dp[0][i] = true;
}
for (int i = 1; i <= n1; i++) {
for (int j = 1; j <= n2; j++) {
if (dp[i][j-1]){
dp[i][j] = dp[i][j - 1];
}else {
if (s.charAt(i - 1) == t.charAt(j - 1) && dp[i-1][j-1]) {
dp[i][j] =dp[i - 1][j - 1];
}else {
dp[i][j] = dp[i][j - 1];
}
}
}
}
return dp[n1][n2];
}
}
|
