2015年5月10日

Minimum Window Substring

摘要： Minimum Window Substring问题：Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n)... 阅读全文

posted @ 2015-05-10 22:08 zhouzhou0615 阅读(132) 评论(0) 推荐(0) 编辑

Edit Distance

摘要： Edit Distance问题：Given two wordsword1andword2, find the minimum number of steps required to convertword1toword2. (each operation is counted as 1 step.)... 阅读全文

posted @ 2015-05-10 11:24 zhouzhou0615 阅读(215) 评论(0) 推荐(0) 编辑

导航