2015年6月29日
115. Distinct Subsequences （Hard）
摘要： 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 string which is formed from t 阅读全文
posted @ 2015-06-29 22:19 linqiaozhou 阅读(357) 评论(0) 推荐(0)
72.Edit Distance（经典的动态规划问题）
摘要： 题目描述Edit DistanceGiven two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 阅读全文
posted @ 2015-06-29 15:32 linqiaozhou 阅读(549) 评论(0) 推荐(0)