[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 th... 阅读全文
posted @ 2012-12-20 08:03
小刀初试
阅读(191)
评论(0)
推荐(0)
