LeetCode (Minimum Window Substring)
来源:互联网 发布:手机淘宝修改评价 编辑:程序博客网 时间:2024/06/06 04:35
Problem:
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 = "ADOBECODEBANC"
T = "ABC"
Minimum window is "BANC"
.
Note:
If there is no such window in S that covers all characters in T, return the empty string ""
.
If there are multiple such windows, 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) { vector<int> map(128, 0); for(auto c : t) map[c]++; int counter = t.size(), l = INT_MAX; int begin = 0, end = 0, head = 0; while(end < s.size()){ if(map[s[end++]]-- > 0) counter--; while(counter == 0){ if(end - begin < l) l = end - (head = begin); if(map[s[begin++]]++ == 0) counter++; } } return l == INT_MAX ? "" : s.substr(head, l); }};
阅读全文
0 0
- 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 Minimum Window Substring
- [LeetCode] Minimum Window Substring
- [LeetCode] Minimum Window Substring
- leetcode minimum window substring
- LeetCode - Minimum Window Substring
- LeetCode:Minimum Window Substring
- Quartz学习——Quartz大致介绍(一)
- hadoop排序
- java迷路记-微信支付之公众号支付小结
- Hive入门安装配置
- 软考--程序设计语言基础
- LeetCode (Minimum Window Substring)
- 输入一个十进制的正整数,从低位开始查找,找到第一个置位(1)比特的位置
- Android BLE开发
- RxJava1.x ------ 取消订阅,Subscription
- js数据结构排序之选择排序
- <视频教程-2>生成对抗网络GAN视频教程part6-完整版
- libuv之事件循环loop
- 类图、用例图、序列图、BCE模式
- 小白题解 Codeforces 785B Anton and Classes