[LeetCode] Minimum Window Substring
2015-03-10 11:30
323 查看
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).
For example,
S =
T =
Minimum window is
Note:
If there is no such window in S that covers all characters in T, return the emtpy string
If there are multiple such windows, you are guaranteed that there will always be only one unique minimum window in S.
利用双指针思想,尾指针不断往后扫,当扫到有一个窗口包含了所有T的字符,然后再收缩头指针,直到不能再收缩为止。
然后再向后扩展,再收缩头指针。。。
最后记录所有可能的情况中窗口最小的
For example,
S =
"ADOBECODEBANC"
T =
"ABC"
Minimum window is
"BANC".
Note:
If there is no such window in S that covers all characters in T, return the emtpy string
"".
If there are multiple such windows, you are guaranteed that there will always be only one unique minimum window in S.
利用双指针思想,尾指针不断往后扫,当扫到有一个窗口包含了所有T的字符,然后再收缩头指针,直到不能再收缩为止。
然后再向后扩展,再收缩头指针。。。
最后记录所有可能的情况中窗口最小的
public class Solution { public String minWindow(String S, String T) { int[] count1 = new int[256]; int[] count2 = new int[256]; for(int i = 0; i < 256; i++){ count1[i] = count2[i] = 0; } int count = T.length(); for(int i = 0; i < count; i++){ count1[T.charAt(i)]++; count2[T.charAt(i)]++; } int start = 0; int minSize = S.length() + 1; int minStart = 0; for(int i = 0; i < S.length(); i++){ if(count2[S.charAt(i)] > 0){ count1[S.charAt(i)]--; if(count1[S.charAt(i)] >= 0) count--; } if(count == 0){ while(true){ if(count2[S.charAt(start)] > 0){ if(count1[S.charAt(start)] < 0) count1[S.charAt(start)]++; else break; } start++; } if(minSize > i - start + 1){ minSize = i -start + 1; minStart = start; } } } if(minSize == S.length() + 1) return ""; return S.substring(minStart, minStart + minSize); } }
相关文章推荐
- LeetCode – Refresh – Minimum Window Substring
- LeetCode 76 Minimum Window Substring
- [Leetcode]Minimum Window Substring
- leetcode minimum window substring
- 【LeetCode】Minimum Window Substring
- Leetcode: Minimum Window Substring
- Leetcode: Minimum Window Substring
- 【leetcode】Minimum Window Substring
- LeetCode - Minimum Window Substring
- Minimum Window Substring 最小子串窗口@LeetCode
- LeetCode-Minimum Window Substring -- 窗口问题
- LeetCode: Minimum Window Substring
- leetcode——Minimum Window Substring
- LeetCode: 76. Minimum Window Substring
- Leetcode231: Minimum Window Substring
- [Leetcode] minimum window substring 最小字符窗口
- LeetCode76 Minimum Window Substring(两种解法)
- leetcode76题 Minimum Window Substring
- leetcode解题笔记-Minimum Window Substring
- 【LeetCode】Minimum Window Substring