Minimum Window Substring

2020-12-13 03:40

阅读：549

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 emtpy string "".

If there are multiple such windows, you are guaranteed that there will always be only one unique minimum window in S.

文章来自：搜素材网的编程语言模块，转载请注明文章出处。
文章标题：Minimum Window Substring
文章链接：http://soscw.com/index.php/essay/28078.html