摘要: https://leetcode.com/problems/distinct-subsequences/ Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequen 阅读全文
posted @ 2017-01-06 19:52 牧马人夏峥 阅读(239) 评论(0) 推荐(0) 编辑