【每日一题】3.21 minimum-window
亲爱的牛客们~
又到了【每日一题】的时候啦，昨天的题目你思考的肿么样了呢？
大家不妨练习一下，欢迎来讨论区和大家一起讨论哟~
今天的题目是这样滴：
【每日一题】0321
[编程题]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"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.
大家可以在下面链接直接在线编程训练哦：
欢迎大家认真思考，积极讨论～
也欢迎高手们把题目翻译成中文，翻译的“信达雅”有奖哟~
