【数组】- 最小覆盖子串

1. 对应力扣题目连接

• 最小覆盖子串

2. 实现案例代码

public class MinimumCoveringSubstring {
    public static void main(String[] args) {

        System.out.println(minWindow("ADOBECODEBANC", "ABC")); // 输出："BANC"
        System.out.println(minWindow("a", "a")); // 输出："a"
        System.out.println(minWindow("a", "aa")); // 输出：""
        System.out.println(minWindow("AAABBB", "AB")); // 输出："AB"
        System.out.println(minWindow("ADOBECODEBANC", "XYZ")); // 输出：""
        System.out.println(minWindow("ABCDABCD", "BCD")); // 输出："BCD"
        System.out.println(minWindow("ABCD", "AB")); // 输出："AB"
        System.out.println(minWindow("XYZABC", "ABC")); // 输出："ABC"
        System.out.println(minWindow("AXBYCZ", "ABC")); // 输出："AXBYC"
        System.out.println(minWindow("AAABBBCCC", "ABC")); // 输出："ABBBC"

    }


    public static String minWindow(String s, String t) {
        if (s.length() == 0 || t.length() == 0) {
            return "";
        }

        // 记录t中字符的需求
        Map<Character, Integer> need = new HashMap<>();
        for (char c : t.toCharArray()) {
            need.put(c, need.getOrDefault(c, 0) + 1);
        }

        // 记录窗口中字符的数量
        Map<Character, Integer> window = new HashMap<>();
        int left = 0, right = 0;
        int valid = 0;
        int start = 0, minLength = Integer.MAX_VALUE;

        while (right < s.length()) {
            char c = s.charAt(right);
            right++;
            // 窗口内数据更新
            if (need.containsKey(c)) {
                window.put(c, window.getOrDefault(c, 0) + 1);
                if (window.get(c).intValue() == need.get(c).intValue()) {
                    valid++;
                }
            }

            // 判断左侧窗口是否要收缩
            while (valid == need.size()) {
                // 更新最小覆盖子串
                if (right - left < minLength) {
                    start = left;
                    minLength = right - left;
                }
                char d = s.charAt(left);
                left++;
                // 窗口内数据更新
                if (need.containsKey(d)) {
                    if (window.get(d).intValue() == need.get(d).intValue()) {
                        valid--;
                    }
                    window.put(d, window.get(d) - 1);
                }
            }
        }

        return minLength == Integer.MAX_VALUE ? "" : s.substring(start, start + minLength);
    }
}