[LeetCode] Minimum Window Substring 解题报告
来源:互联网 发布:智能电视点歌软件 编辑:程序博客网 时间:2024/05/20 17:24
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 =
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 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.
» Solve this problem
[解题报告]
双指针,动态维护一个区间。尾指针不断往后扫,当扫到有一个窗口包含了所有T的字符后,然后再收缩头指针,直到不能再收缩为止。最后记录所有可能的情况中窗口最小的
[Code]
1: string minWindow(string S, string T) {
2: // Start typing your C/C++ solution below
3: // DO NOT write int main() function
4: if(S.size() == 0) return "";
5: if(S.size() < T.size()) return "";
6: int appearCount[256];
7: int expectCount[256];
8: memset(appearCount, 0, 256*sizeof(appearCount[0]));
9: memset(expectCount, 0, 256*sizeof(appearCount[0]));
10: for(int i =0; i < T.size(); i++)
11: {
12: expectCount[T[i]]++;
13: }
14: int minV = INT_MAX, min_start = 0;
15: int wid_start=0;
16: int appeared = 0;
17: for(int wid_end = 0; wid_end< S.size(); wid_end++)
18: {
19: if(expectCount[S[wid_end]] > 0)// this char is a part of T
20: {
21: appearCount[S[wid_end]]++;
22: if(appearCount[S[wid_end]] <= expectCount[S[wid_end]])
23: appeared ++;
24: }
25: if(appeared == T.size())
26: {
27: while(appearCount[S[wid_start]] > expectCount[S[wid_start]]
28: || expectCount[S[wid_start]] == 0)
29: {
30: appearCount[S[wid_start]]--;
31: wid_start ++;
32: }
33: if(minV > (wid_end - wid_start +1))
34: {
35: minV = wid_end - wid_start +1;
36: min_start = wid_start;
37: }
38: }
39: }
40: if(minV == INT_MAX) return "";
41: return S.substr(min_start, minV);
42: }
[已犯错误]
1. Line 8&9
不熟悉这个api,最初写成了
memset(expectCount, 0, 256);
结果老是出问题,检查了很多遍logic,也没发现有问题,最后还是放到VS下debug才发现原来是地址空间大小没有传对。正确的应该是:
memset(expectCount, 0, 256*sizeof(appearCount[0]));
0 0
- [LeetCode] Minimum Window Substring 解题报告
- [leetcode] 76. Minimum Window Substring 解题报告
- [Leetcode] 76. Minimum Window Substring 解题报告
- [leetcode]76. Minimum Window Substring@Java解题报告
- leetcode解题笔记-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
- [leetcode]Minimum Window Substring
- Leetcode:Minimum Window Substring
- LeetCode-Minimum Window Substring
- [leetcode] Minimum Window Substring
- [leetcode] Minimum Window Substring
- [LeetCode] Merge Sorted Array 解题思路
- 调用活动,通过intent显式调用
- du&df
- [LeetCode] Minimum Depth of Binary Tree
- [LeetCode] Minimum Path Sum 解题报告
- [LeetCode] Minimum Window Substring 解题报告
- [LeetCode] Multiply Strings 解题报告
- [LeetCode] Next Permutation 解题报告
- [LeetCode] Palindrome Number 解题报告
- [LeetCode] Partition List 解题报告
- [LeetCode] Pascal’s Triangle II 解题报告
- Android 之 Fresco 显示圆形图片 之坑
- [LeetCode] Path Sum II 解题报告
- [LeetCode] Permutations 解题报告