daily leetcode - minimum-window-substring - !
题目地址 https://leetcode.com/problems/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. 思路 这道题给了我们一个原字符串 S,还有一个目标字符串 T,让在 S 中找....