2017年2月22日
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-02-22 13:47 Pacific-hong 阅读(142) 评论(0) 推荐(0) 编辑