2014年12月24日
【leetcode】Distinct Subsequences(hard)
摘要： 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 the orig... 阅读全文
posted @ 2014-12-24 10:25 匡子语 阅读(169) 评论(0) 推荐(0)