Fork me on GitHub
2017年5月29日
[leetcode-115-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 t 阅读全文
posted @ 2017-05-29 20:18 hellowOOOrld 阅读(181) 评论(0) 推荐(0)