LeetCode Distinct Subsequences
2013-03-13 14:19
260 查看
class Solution {
public:
int numDistinct(string S, string T) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int s_len = S.size();
int t_len = T.size();
vector<int> rec (t_len + 1);
rec[0] = 1;
for (int i = 0; i < s_len; i++) {
for (int j = t_len - 1; j >= 0; j--) {
rec[j + 1] += (S[i] == T[j]) * rec[j];
}
}
return rec[t_len];
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode – Distinct Subsequences Total
- LeetCode Distinct Subsequences
- leetcode -- Distinct Subsequences
- leetcode Distinct Subsequences
- LeetCode115 Distinct Subsequences
- LeetCode 115: Distinct Subsequences
- Leetcode Distinct Subsequences 解题报告
- leetcode: Distinct Subsequences
- [Leetcode] Distinct Subsequences *
- LeetCode Distinct Subsequences
- leetcode Distinct Subsequences
- #leetcode#Distinct Subsequences
- LeetCode Distinct Subsequences
- leetcode Distinct Subsequences
- Leetcode：Distinct Subsequences
- Leetcode Distinct Subsequences 动态规划法活用总结
- Distinct Subsequences leetcode
- LeetCode: Distinct Subsequences [115]
- leetcode Distinct Subsequences
- LeetCode Distinct Subsequences(动态规划)