力扣之数组 长度最小的子数组

长度最小的子数组

上一个有序数组已经写了，暴力法就不说了，没意义，carl 长度最小的子数组原文:长度最小的子数组

209:长度最小的子数组

//双重循环暴力解决
class Solution {
public:
    int minSubArrayLen(int target, vector<int>& nums) {
        int length = INT32_MAX;
        int sub = 0;
        int sum;
        for(int i = 0; i < nums.size(); i++){
            sum = 0;
            for(int j = i; j < nums.size();j++){
                sum += nums[j];
                if(sum >= target){
                    sub = j - i + 1;
                    length = length > sub ? sub :length;
                    break;
                }            
            }           
        }
        return length == INT32_MAX?  0 : length;
    }
};

//滑动窗口
class Solution {
public:
    int minSubArrayLen(int target, vector<int>& nums) {
        int length = INT32_MAX;
        int sub = 0;
        int sum = 0;
        int j = 0;
        for(int i = 0; i < nums.size(); i++){
            sum += nums[i];
            while(sum >= target){
                sub = i - j + 1;
                length = length > sub ?sub : length;
                sum  -= nums[j++];
            }
        }
        return length == INT32_MAX?  0 : length;        
    }
};

904. 水果成篮

//c++滑动窗口，哈希表做篮子
class Solution {
public:
    int totalFruit(vector<int>& fruits) {
        int length = INT32_MIN;
        int sub = 0;
        int begin = 0;
        std::unordered_map<int,int> lanzi;
        for(int i = 0; i < fruits.size(); i++){
            sub ++;               
            lanzi[fruits[i]]++;
            while(lanzi.size()>2){
                lanzi[fruits[begin]]--;
                if(lanzi[fruits[begin]]==0)lanzi.erase(fruits[begin]);  
                begin++;  
                sub--;               
            }
            length = length > sub ? length : sub;
        }              
        return length;
    }
};

76. 最小覆盖子串

class Solution {
public:
    string minWindow(string s, string t) {
        unordered_map<int, int> hs, ht;
        for(auto tt : t) ht[tt]++;

        int dis = 0;
        string result;

        for(int left = 0,right = 0; right < s.size(); right++){
            hs[s[right]]++;

            if(hs[s[right]] <= ht[s[right]])dis++;

            while(ht[s[left]] < hs[s[left]])hs[s[left++]]--;
            if(dis == t.size() ){
                if(result.empty() || result.size() > right - left + 1)
                result = s.substr(left,right - left + 1);
            }
        }
        return result;
    }
};