[leetcode] Minimum Window Substring
2013-08-15 17:26
288 查看
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 =
T =
Minimum window is
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.
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.
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode:Minimum Window Substring
- [Leetcode] Minimum Window Substring
- LeetCode76 Minimum Window Substring（两种解法）
- [Leetcode] Minimum Window Substring My Submissions Question Solution
- LeetCode: Minimum Window Substring
- LeetCode刷题笔记（贪心）：minimum-window-substring
- 143_leetcode_Minimum Window Substring
- LeetCode Minimum Window Substring
- LeetCode: Minimum Window Substring [076]
- LeetCode OJ Minimum Window Substring
- LeetCode--Minimum Window Substring
- LeetCode Minimum Window Substring
- [LeetCode] Minimum Window Substring
- LeetCode76 Minimum Window Substring（两种解法）
- leetcode: Minimum Window Substring
- Leetcode-76 Minimum Window Substring
- leetcode hard模式专杀之76 Minimum Window Substring
- [Leetcode]Substring with Concatenation of All Words & Minimum Window Substring
- 【LeetCode】Minimum Window Substring
- Leetcode-Minimum Window Substring