【Leetcode】115. Distinct Subsequences
摘要：
Description: Given two string S and T, you need to count the number of T's subsequences appeared in S. The fucking problem description is so confusing 阅读全文
posted @ 2016-07-11 15:46 暴力的轮胎 阅读(146) 评论(0) 推荐(0) 编辑
