剑指-017

最新推荐文章于 2024-07-25 11:27:31 发布

一条吃猫的鱼

最新推荐文章于 2024-07-25 11:27:31 发布

阅读量153

点赞数

分类专栏：剑指文章标签：算法 c++ leetcode

本文链接：https://blog.csdn.net/qq_43822715/article/details/128143214

版权

剑指专栏收录该内容

20 篇文章 0 订阅

订阅专栏

最后两个测试案例超时！

class Solution {
    public String minWindow(String s, String t) {
        int len1 = s.length();
        int len2 = t.length();
        if(len1 < len2){
            return "";
        }
        Map<Character, Integer> map = fun(t);
        int mini = 0;
        int minj = 0;
        int minl = Integer.MAX_VALUE;
        boolean sign = false;
        for(int i = 0; i < len1; i++){
            if(map.containsKey(s.charAt(i))){
                int j = i;
                while(j < len1){
                    map.put(s.charAt(j), map.getOrDefault(s.charAt(j), 0) - 1);
                    if(map.containsKey(s.charAt(j)) && map.get(s.charAt(j)) <= 0){
                        map.remove(s.charAt(j));
                    }
                    if(map.size() == 0 && j - i + 1 < minl){
                        sign = true;
                        mini = i;
                        minj = j;
                        minl = j - i + 1;
                        break;
                    }
                    j++;
                }
                map = fun(t);
            }
        }
        return sign?s.substring(mini, minj + 1):"";
    }

    public Map<Character, Integer> fun(String s){
        int len = s.length();
        Map<Character, Integer> map = new HashMap<>();
        for(int i = 0; i < len; i++){
            map.put(s.charAt(i), map.getOrDefault(s.charAt(i), 0) + 1);
        }
        return map;
    }
}

答案

class Solution {
    public String minWindow(String s, String t) {
        int len1 = s.length();
        int len2 = t.length();
        if(len1 < len2){
            return "";
        }
        int[] sign = new int[58];
        for(int i = 0; i < len2; i++){
            sign[t.charAt(i) - 'A']++;
        }
        int begin = 0;
        int end = -1;
        int count = 0;
        int min = Integer.MAX_VALUE;
        boolean a = false;
        for(int left = 0, right = 0; right < len1; right++){
            sign[s.charAt(right) - 'A']--;
            if(sign[s.charAt(right) - 'A'] >= 0){
                count++;
            }
            while(count == len2){
                if(right - left + 1 < min){
                    begin = left;
                    end = right + 1;
                    min = end - begin;
                    a = true;
                }
                sign[s.charAt(left) - 'A']++;
                if(sign[s.charAt(left) - 'A'] > 0){
                    count--;
                }
                left++;
            }
        }
        return a?s.substring(begin,end):"";
    }
}