public class DiffSeq {
public static void main(String[] args) {
System.out.println(numDistinct("rabbbit", "rabbit"));
}
public static int numDistinct(String s, String t) {
int[][] dp = new int[s.length() + 1][t.length() + 1];
dp[0][0] = 1;
for (int i = 1; i <= s.length(); i++) {
for (int j = 1; j <= i && j <= t.length(); j++) {
if (s.charAt(i - 1) == t.charAt(j - 1)) {
//dp[i][j] = dp[i - 1][j] + 1;
dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j];
} else {
dp[i][j] = dp[i - 1][j];
}
}
}
return dp[s.length()][t.length()];
}
}
LeetCode115 不同的子序列
于 2024-09-24 20:07:07 首次发布