76. Minimum Window Substring

Posted 2021-01-31 ruisha

tags:

篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了76. 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).

Example:

Input: S = "ADOBECODEBANC", T = "ABC"
Output: "BANC"

Note:

If there is no such window in S that covers all characters in T, return the empty string "".
If there is such window, you are guaranteed that there will always be only one unique minimum window in S.

以上是关于76. Minimum Window Substring的主要内容，如果未能解决你的问题，请参考以下文章