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"

>>阅读原文<<