leetcode-115. Distinct Subsequences
摘要：
1、原题链接 Given a string S and a string T, count the number of distinct subsequences of S which equals T. A subsequence of a string is a new string which 阅读全文
posted @ 2017-11-20 23:35 Shihu 阅读(185) 评论(0) 推荐(0) 编辑
