2013 年 7月 16 日随笔档案 - lichen782

2013年7月16日

LeetCode 笔记系列16.3 Minimum Window Substring [从O(N*M)， O(NlogM)到O(N)，人生就是一场不停的战斗]

摘要：题目：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="ADOBECODEBANC"T="ABC"Minimum window is"BANC".Note:If there is no such window in S that covers all characters in T, return the em 阅读全文

posted @ 2013-07-16 18:45 lichen782 阅读(5339) 评论(1) 推荐(4)

LeetCode 笔记系列16.2 Minimum Window Substring [从O(N*M)， O(NlogM)到O(N)，人生就是一场不停的战斗]

posted @ 2013-07-16 17:14 lichen782 阅读(873) 评论(0) 推荐(0)

LeetCode 笔记系列16.1 Minimum Window Substring [从O(N*M)， O(NlogM)到O(N)，人生就是一场不停的战斗]

摘要：题目：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="ADOBECODEBANC" T="ABC" Minimum window is"BANC". Note: If there is no such window in S that covers all characters in T, return 阅读全文

posted @ 2013-07-16 16:48 lichen782 阅读(1270) 评论(0) 推荐(0)