#32 Minimum Window Substring

题目描述:

Given a string source and a string target, find the minimum window in source which will contain all the characters in target.

 Notice

If there is no such window in source that covers all characters in target, return the emtpy string "".

If there are multiple such windows, you are guaranteed that there will always be only one unique minimum window in source.

Clarification

Should the characters in minimum window has the same order in target?

  • Not necessary.
Example

For source = "ADOBECODEBANC", target = "ABC", the minimum window is "BANC"

Challenge 

Can you do it in time complexity O(n) ?

题目思路:

这题还是用two pointers的思想。如果得到的substring已经满足要求了,我们就让l前进来shrink这个substring;如果还没满足要求,那就让r前进来加入新的char。满足要求的意思,就是建的hashmap中,所有的value都小于等于0.

Mycode(AC = 28ms):

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
        if (source == "" || target == "") {
            return "";
        }
        
        // put the chars in target into map
        map<char, int> counter;
        source = source + " ";
        for (int i = 0; i < target.size(); i++) {
            if (counter.find(target[i]) != counter.end()) {
                counter[target[i]] += 1;
            }
            else {
                counter[target[i]] = 1;
            }
        }
        
        int l = 0, r = 0;
        string ans = "";
        
        // use two pointers to find the minimum length substring
        while (r < source.size()) {
            if (isValid(counter)) {
                string tmp = source.substr(l, r - l);
                if (ans == "" || tmp.size() < ans.size()) {
                    ans = tmp;
                }
                adjustCounter(counter, source[l], true);
                l++;
            }
            else {
                adjustCounter(counter, source[r], false);
                r++;
            }
        }
        
        return ans;
    }
    
    // add or delete a char in the counter
    void adjustCounter(map<char, int>& counter, char key, bool add) {
        if (counter.find(key) != counter.end()) {
            counter[key] = add? counter[key] + 1: counter[key] - 1;
        }
    }
    
    // if all chars in target (is valid), then all keys' value in counter should
    // be <= 0
    bool isValid(map<char, int>& counter) {
        for (auto it = counter.begin(); it != counter.end(); it++) {
            if (it->second > 0) return false;
        }
        return true;
    }
};


阅读更多
版权声明:三千微尘里,吾宁爱与憎 https://blog.csdn.net/haifischxia/article/details/52351242
个人分类: lintcode
上一篇#34 N-Queens II
下一篇#31 Partition Array
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭