2014年2月11日
leetcode--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).For example,S="ADOBECODEBA... 阅读全文
posted @ 2014-02-11 12:56 Averill Zheng 阅读(166) 评论(0) 推荐(0)
leetcode--Palindrome Partitioning II
摘要： Given a strings, partitionssuch that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning ofs... 阅读全文
posted @ 2014-02-11 00:34 Averill Zheng 阅读(175) 评论(0) 推荐(0)