2015年1月24日

Distinct Subsequences -- Leetcode
摘要： Problem:Given a stringSand a stringT, count the number of distinct subsequences ofTinS.A subsequence of a string is a new string which is formed from ... 阅读全文
posted @ 2015-01-24 15:07 日拱一卒编程大法 阅读(1045) 评论(1) 推荐(0) 编辑

导航