LeetCode - Minimum Window Substring

最新推荐文章于 2020-05-24 13:28:15 发布

yangyuwei11

最新推荐文章于 2020-05-24 13:28:15 发布

阅读量512

点赞数

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/yangyuwei11/article/details/10553311

版权

LeetCode 专栏收录该内容

121 篇文章

订阅专栏

本文介绍了一种在字符串S中寻找包含字符串T所有字符的最短子串的算法，复杂度为O(n)。通过实例演示了如何实现该算法，并提供了完整的C++代码示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

class Solution {
public:
     string minWindow(string S, string T) {
		 string result;
		 const int N=256;
		 int l1=S.length(),l2=T.length(),tmp=0,counter=0,min=l1+1;
		 if(l1<l2){
			 return result;
		 }
		 vector<int> num(N,0);
		 vector<int> visited(N,0);
	 
		 for(int i=0;i<l2;i++){
			 num[T[i]]++;
		 }
		 int i=0,j=-1;
		 while(i<=l1-l2&&j<l1){
			if(!num[S[i]]){
				i++;
				continue;
			}
			while(j<l1&&counter!=l2){
				j++;
				tmp=S[j];
				if(visited[tmp]<num[tmp]){
					counter++;
				}
				visited[tmp]++;
			}
			if(counter==l2){
				tmp=j-i+1;
				if(tmp<min){
	 				min=tmp;
					result.assign(S,i,tmp);
				}
				tmp=S[i];
				if(visited[tmp]>0){
			 		visited[tmp]--;
				}
				if(visited[tmp]<num[tmp]&&counter>0){
					counter--;
				}
				i++;
			} 
		}
		return result;
	}
};