![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
dp
文章平均质量分 73
蜜莉恩
这个作者很懒,什么都没留下…
展开
-
Edit Distance (LeetCode)
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted on a word:原创 2014-01-27 09:08:58 · 401 阅读 · 0 评论 -
Distinct Subsequences (LeetCode)
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原创 2014-01-27 10:01:27 · 398 阅读 · 0 评论