DP
文章平均质量分 80
KiraYin--
这个作者很懒,什么都没留下…
展开
-
[LeetCode] Distinct Subsequences
Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a string is a new string which is formed from the original string by deleting some (can be non原创 2013-10-24 11:03:05 · 617 阅读 · 0 评论 -
[LeetCode] HouseRobber
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent house原创 2015-07-07 11:29:03 · 782 阅读 · 0 评论 -
[LeetCode] Distinct Subsequences
Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a string is a new string which is formed from the original string by deleting some (can be non原创 2015-08-06 11:52:46 · 670 阅读 · 0 评论