115. Distinct Subsequences
来源:互联网 发布:皮蓬总决赛数据 平均 编辑:程序博客网 时间:2024/05/18 23:57
这道题是这样的,我拿个例子来说
public class Solution { public int numDistinct(String s, String t) { int [][]dp = new int[t.length()][s.length()]; for(int i=0;i<t.length();i++){ for(int j =0;j<s.length();j++){ if(i==0){ if(t.charAt(i)==s.charAt(j)){ dp[i][j]=1; } }else{ if(t.charAt(i)==s.charAt(j)){ int sum=0,max=0; for (int k=0;k<j;k++){//找到之前可以的点的所有和 if(dp[i-1][k]>0)sum+=dp[i-1][k]; } dp[i][j] = sum; } } } } int all = 0; for (int i =0;i<s.length();i++){ all+=dp[t.length()-1][i]; } return all; }}
0 0
- LeetCode 115. Distinct Subsequences
- [Leetcode] 115. Distinct Subsequences
- 115.Distinct Subsequences
- [leetcode] 115.Distinct Subsequences
- [leetcode] 115.Distinct Subsequences
- 115. Distinct Subsequences
- Leetcode 115. Distinct Subsequences
- 【LeetCode】115. Distinct Subsequences
- 115. Distinct Subsequences
- LeetCode 115. Distinct Subsequences
- [leetcode]115. Distinct Subsequences
- LeetCode-115.Distinct Subsequences
- 115. Distinct Subsequences
- [LeetCode] 115. Distinct Subsequences
- 115. Distinct Subsequences
- 115. Distinct Subsequences
- 115. Distinct Subsequences
- 115. Distinct Subsequences
- 网络问题
- 绿色软件如何设置windows自启动?
- 安卓高级8 SurfaceView (1)
- Git常用命令总结
- LeetCode 438. Find All Anagrams in a String
- 115. Distinct Subsequences
- Java RMI之HelloWorld篇
- [转载]处理百万级以上的数据提高查询速度的方法
- CTF writeup 1_网络安全实验室
- 安卓高级8 SurfaceView案例二 自定义相机
- PAT1039. 到底买不买(20)
- 杭电oj编码2029
- 【Linux学习】epoll详解
- SAP ERP常用T-CODE