zoukankan      html  css  js  c++  java
  • 53. Minimum Window Substring

    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.

    思路:涉及到2点: 1. Hash, 保证查找为 O(1). 2. S 中设置两指针,根据长度确定右边指针位置;根据若去掉该字符,则该字符在 window 中出现次数将小于在 T 中出现的次数确定左边指针位置。

    class Solution {
    public:
    	string minWindow(string S, string T) {
    		if(T == "" || S == "") return "";
    		string s;
    		int ch[2]['z'+1] = {0};
    		for(int i = 0; i < T.size(); ++i) ++ch[0][T[i]];
    		int first = 0, cnt = 0;
    		for(int second = 0; second < S.size(); ++second) {
    			if(ch[0][S[second]]) { 
    				if(ch[0][S[second]] > ch[1][S[second]])
    					++cnt; 
    				++ch[1][S[second]];
    			}
    			if(cnt == T.size()) {
    				while(ch[0][S[first]] == 0 || ch[1][S[first]] > ch[0][S[first]]) {  
    					if(ch[1][S[first]] > ch[0][S[first]])
    						ch[1][S[first]]--;
    					++first;
    				}
    				string tem = S.substr(first, second-first+1);
    				if(s == "" || s.size() > tem.size()) s = tem;
    				--ch[1][S[first++]];
    				--cnt;
    			}
    		}
    		return s;
    	}
    };
    
  • 相关阅读:
    【转】5亿个数找中位数
    C++二维数组名的再探索
    转载 图像卷积
    PowerDesigner的使用一
    Spring注解详解
    JSP页面以及简单的指令
    Javascript学习总结
    html第一天
    Chrome开发,debug的使用方法。
    SVN使用
  • 原文地址:https://www.cnblogs.com/liyangguang1988/p/3954273.html
Copyright © 2011-2022 走看看