最小子串

给出source = "ADOBECODEBANC"，target = "ABC" 满足要求的解 "BANC"

相同题目：

题目：给一篇文章,里面是由一个个单词组成,单词中间空格隔开,再给一个字符串指针数组,比如 char *str[]= {“hello”,”world”,”good”}; 

求文章中包含这个字符串指针数组的最小子串。注意,只要包含即可,没有顺序要求。 提示:文章也可以理解为一个大的字符串数组,单词之前只有空格,没有标点符号。

class Solution {
public:    
    /**
     * @param source: A string
     * @param target: A string
     * @return: A string denote the minimum window
     *          Return "" if there is no such a string
     */
    string minWindow(string &source, string &target) {
        // write your code here
        int sizeSource = source.size(), sizeTarget = target.size();
        if(sizeSource == 0) {
            return string("");
        }

        int i, countSource[128], countTarget[128];
        for(i=0; i<128; i++) {
            countSource[i] = 0;
            countTarget[i] = 0;
        }

        for(i=0; i<sizeTarget; i++) {
            countTarget[target[i]]++;
        }

        int begin = -1, end = sizeSource, start = 0, found = 0, minLen = sizeSource;
        for(i=0,start=i; i<sizeSource; i++) {
            countSource[source[i]]++;

            if (countSource[source[i]] <= countTarget[source[i]]) {  
                found++;
            }
 
            if (found == sizeTarget) {  
                while (start < i && countSource[source[start]] > countTarget[source[start]]) {  
                    countSource[source[start]]--;  
                    start++;  
                }
                
                if (i - start < minLen) {  
                    minLen = i - start;  
                    begin = start;  
                    end = i;  
                }

                countSource[source[start++]]--;  
                found--;  
            }
        }

        if (begin == -1) {
            return string("");
        }
        else {
            return source.substr(begin, end - begin + 1);
        }
    }
};