class Solution {
public int numDistinct(String s, String t) {
int n = s.length();
int m = t.length();
if (n == 0) {
return 0;
}
if (m == 0) {
return 1;
}
//if (n == m) {
// return s == t ? m:1;
//}
if (n < m) {
return 0;
}
s = ' ' + s;
t = ' ' + t;
int[][] dp = new int[n + 1][m + 1];
for (int i = 0; i <= n; i++) {
dp[i][0] = 1;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
dp[i][j] = dp[i - 1][j];
if (s.charAt(i) == t.charAt(j)){
dp[i][j] += dp[i - 1][j - 1];
}
}
}
return dp[n][m];
}
}
115. 不同的子序列 java
最新推荐文章于 2024-08-22 17:27:46 发布