76. 最小覆盖子串
难度:困难
给你一个字符串 s
、一个字符串 t
。返回 s
中涵盖 t
所有字符的最小子串。如果 s
中不存在涵盖 t
所有字符的子串,则返回空字符串 ""
。
**注意:**如果 s
中存在这样的子串,我们保证它是唯一的答案。
示例 1:
输入:s = "ADOBECODEBANC", t = "ABC"
输出:"BANC"
示例 2:
输入:s = "a", t = "a"
输出:"a"
提示:
1 <= s.length, t.length <= 10^5
s
和t
由英文字母组成
**进阶:**你能设计一个在 o(n)
时间内解决此问题的算法吗?
解答:
class Solution {
//滑动窗口
//时间复杂度O(N), 空间复杂度O(N)
Map<Character, Integer> ori = new HashMap<>();
Map<Character, Integer> cnt = new HashMap<>();
public String minWindow(String s, String t) {
for(int i = 0; i < t.length(); i++){
ori.put(t.charAt(i), ori.getOrDefault(t.charAt(i), 0) + 1);
}
int left = 0, right = -1;
int len = Integer.MAX_VALUE, ansL = -1, ansR = -1;
int sLen = s.length();
while(right < sLen){
right++;
if(right < sLen && ori.containsKey(s.charAt(right))){
cnt.put(s.charAt(right), cnt.getOrDefault(s.charAt(right), 0) + 1);
}
while(isOk() && left <= right){
if(right - left + 1 < len){
len = right - left + 1;
ansL = left;
ansR = left + len;
}
if(ori.containsKey(s.charAt(left))){
cnt.put(s.charAt(left), cnt.getOrDefault(s.charAt(left), 0) - 1);
}
left++;
}
}
return ansL == -1 ? "" : s.substring(ansL, ansR);
}
public boolean isOk(){
Iterator iter = ori.entrySet().iterator();
while(iter.hasNext()){
Map.Entry entry = (Map.Entry) iter.next();
Character key = (Character) entry.getKey();
Integer value = (Integer) entry.getValue();
if(cnt.getOrDefault(key, 0) < value){
return false;
}
}
return true;
}
}
class Solution {
//滑动窗口
//时间复杂度O(N), 空间复杂度O(N)
public String minWindow(String s, String t) {
int sLen = s.length();
int tLen = t.length();
if(sLen == 0 || tLen == 0 || sLen < tLen) return "";
char[] sCharArr = s.toCharArray();
char[] tCharArr = t.toCharArray();
int[] ret = new int[128];
for(char ch : tCharArr) ret[ch]++;
int left = 0, right = 0;
int ansBegin = 0, minLength = sLen + 1;
//移动右边
while(right < sLen){
char ch = sCharArr[right];
if(ret[ch] > 0) tLen--;
ret[ch]--;
if(tLen == 0){
//移动左边
while(left < right && ret[sCharArr[left]] < 0){
ret[sCharArr[left]]++;
left++;
}
if((right + 1 - left) < minLength){
ansBegin = left;
minLength = right - left + 1;
}
ret[sCharArr[left]]++;
tLen++;
left++;
}
right++;
}
if(minLength == (sLen + 1)) return "";
return s.substring(ansBegin, ansBegin + minLength);
}
}
参考自:
作者:LeetCode-Solution
链接:https://leetcode-cn.com/problems/minimum-window-substring/solution/zui-xiao-fu-gai-zi-chuan-by-leetcode-solution/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。