Leetcode.76 Minimum Window Substring (Java)

2021-04-02 16:26

阅读：663

标签：etc The lex while unique nta imu nim complex

Leetcode.76 Minimum Window Substring

Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).

Example:

Input: S = "ADOBECODEBANC", T = "ABC"
Output: "BANC"

Note:

If there is no such window in S that covers all characters in T, return the empty string "".
If there is such window, you are guaranteed that there will always be only one unique minimum window in S.

Solution

class Solution {
    public String minWindow(String s, String t) {
        int sl = s.length();
        int tl = t.length();
        if(sl == 0 || tl == 0 || sl = 0){
                co ++;
            }
            // 当找到substring需要夹逼找到最短的字串
            if(co == tl){
                while(freq[s.charAt(l)]

Leetcode.76 Minimum Window Substring (Java)

标签：etc The lex while unique nta imu nim complex

原文地址：https://www.cnblogs.com/xm08030623/p/13475945.html

上一篇：php读取在线远程txt文档内容到数组并遍历

下一篇：Java零基础小白必看的学习路线图，快速入门！

文章来自：搜素材网的编程语言模块，转载请注明文章出处。
文章标题：Leetcode.76 Minimum Window Substring (Java)
文章链接：http://soscw.com/index.php/essay/71447.html

亲，登录后才可以留言！

Leetcode.76 Minimum Window Substring (Java)

Leetcode.76 Minimum Window Substring

Solution

评论

热门文章

推荐文章

最新文章

置顶文章