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 = "ADOBECODEBANC"
T = "ABC"
Minimum window is "BAN
原创
2014-08-09 23:36:12 ·
558 阅读 ·
0 评论