2015年3月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 @ 2015-03-11 15:04 穆穆兔兔 阅读(177) 评论(0) 推荐(0) 编辑
[LeetCode] Set Matrix Zeroes
摘要： Given amxnmatrix, if an element is 0, set its entire row and column to 0. Do it in place.click to show follow up.Follow up:Did you use extra space?A s... 阅读全文
posted @ 2015-03-11 11:00 穆穆兔兔 阅读(154) 评论(0) 推荐(0) 编辑