2015年7月26日
[LeetCode] Distinct Subsequences
摘要： Well, a dynamic programming problem. Let's first define its statedp[i][j]to be the number of distinct subsequences oft[0..i - 1]ins[0..j - 1]. Then we... 阅读全文
posted @ 2015-07-26 12:44 jianchao-li 阅读(230) 评论(0) 推荐(0) 编辑