2015年3月28日

Distinct Subsequences

摘要： Distinct Subsequences 问题： Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a string is a new str 阅读全文

posted @ 2015-03-28 21:18 zhouzhou0615 阅读(137) 评论(0) 推荐(0) 编辑

Decode Ways

摘要： Decode Ways问题：A message containing letters fromA-Zis being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded... 阅读全文

posted @ 2015-03-28 20:30 zhouzhou0615 阅读(129) 评论(0) 推荐(0) 编辑

导航