Minimum Window Substring

最新推荐文章于 2018-09-25 21:09:15 发布
最新推荐文章于 2018-09-25 21:09:15 发布
阅读量218 收藏
点赞数
分类专栏： LeetCode
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/buki26/article/details/74990085
版权

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 emtpy string “”.

If there are multiple such windows, you are guaranteed that there will always be only one unique minimum window in S.

这道题的要求是在给定的字符串S中找到最小的窗口使其完全包含字符串T中所有字符，如果不存在，则返回空串”“。

只记思路吧，动态规划。
用一个哈希表记录目标字符串每个字母的个数，一个哈希表记录窗口中每个字母的个数。先找到第一个有效的窗口，用两个指针标出它的上界和下界。然后每次窗口右界向右移时，将左边尽可能的右缩，右缩的条件是窗口中字母的个数不小于目标字符串中字母的个数。

tips：只有字母的情况下（包括大小写），可以用一个128位的char数组来表示哈希表，因为字母的ASCII码都在这个范围内
（a~z：97~122；A~Z：65~90）

buki26
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
pascals-triangle-ii
buki26的博客
07-12 337
Given an index k, return the k th row of the Pascal’s triangle. For example, given k = 3, Return[1,3,3,1].
LeetCode 76. Minimum Window Substring
温迪今天刷题了吗
08-17 178
LeetCode 76. Minimum Window Substring (hard) 主要知识点：sliding window；优先级：5
76. Minimum Window Substring
lifeqiuzhi521的博客
09-25 244
LeetCode Explore Problems Mock Contest Articles Discuss Store Premium New Playground lifeqiuzhi520 76. Minimum Window Substring DescriptionHintsSubmissionsDiscussSolution Given a string S and a ...
leetcode76-LeetCode76_MinimumWindowSubstring:LeetCode76_MinimumWindowSu
06-30
标题 "LeetCode76-LeetCode76_MinimumWindowSubstring:LeetCode76_MinimumWindowSu" 指向的是一个关于LeetCode第76题的解决方案。这道题目要求找到一个给定字符串中最小子串，该子串包含了另一个给定的字符集（目标...
leetcode分类-leetcode:leetcode
06-30
window 滑动窗口类型的题目经常是用来执行数组或是链表上某个区间（窗口）上的操作。比如找最长的全为1的子数组长度。滑动窗口一般从第一个元素开始，一直往右边一个一个元素挪动。 Leetcode Java Python 209. ...
leetcode添加元素使和等于-leetcode:我的leetcode解决方案
06-30
Substring C++ STL中常见容器的时间复杂度 map, set, multimap, and multiset 上述四种容器采用红黑树实现，红黑树是平衡二叉树的一种。不同操作的时间复杂度近似为: 插入:O(logN) 查看:O(logN) 删除:O(logN) hash_...
c++-c++编程基础之leetcode题解第76题最小覆盖子串.zip
最新发布
04-16
第76题"最小覆盖子串"（Minimum Window Substring）是其中一道经典的字符串处理问题，它涉及到字符串查找、滑动窗口等算法概念。在这个题解压缩包中，你将找到关于如何使用C++解决这道题目的详细步骤和代码实现。 ...
1、基础算法必练题（含解法））.pdf
09-21
12. **Minimum Window Substring**：找到包含所有目标字符的最小子串。滑动窗口或双指针技术是常用的解决方案。 13. **Merge Two Sorted Lists**：合并两个已排序的链表。可以使用迭代或递归方法，每次选取两个链表...
树的最小深度
buki26的博客
06-28 419
给定一棵二叉树，返回树的最小深度。最小深度是从根节点到叶子结点的最短路径。
sum-root-to-leaf-numbers
buki26的博客
07-24 414
Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number. An example is the root-to-leaf path1->2->3which represents the number123. Find the total sum of all
max-points-on-a-line
buki26的博客
06-29 377
Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.
convert-sorted-list-to-binary-search-tree
buki26的博客
07-03 293
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.
remove-nth-node-from-end-of-list
buki26的博客
07-07 281
Given a linked list, remove the n th node from the end of list and return its head.
path-sum i & ii
buki26的博客
07-25 266
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. For example: Given the below binary tree andsum =
minimum-path-sum
buki26的博客
09-08 261
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at any
linked-list-cycle-ii
buki26的博客
07-03 259
Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Follow up: Can you solve it without using extra space?
翻转链表
buki26的博客
07-01 260
单链表原地翻转的问题
pascals-triangle
buki26的博客
07-12 246
Given numRows, generate the first numRows of Pascal’s triangle. For example, given numRows = 5, Return [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ]
Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty string "".
06-03
To solve this problem, we can use the sliding window approach again. Here's the algorithm: 1. Initialize two dictionaries: need and window. need stores the count of each character in t, and window stores the count of each character in the current window. 2. Initialize two pointers left and right to mark the current window, and two variables match and required to track the number of matched characters and the number of required characters respectively. 3. Initialize a variable min_len to a large value and a variable start to 0 to store the start index of the minimum window substring. 4. While the right pointer is less than the length of the string s: - If the character at s[right] is in need, add it to window and update match and required accordingly. - While all characters in need are included in window, update min_len and start accordingly, and remove the character at s[left] from window and update match and required accordingly. - Move the left pointer to the right. - Move the right pointer to the right. 5. Return the minimum window substring starting from index start and having length min_len, or the empty string if no such substring exists. Here's the Python code for the algorithm: ``` def min_window(s, t): need = {} for c in t: need[c] = need.get(c, 0) + 1 window = {} left = right = 0 match = 0 required = len(need) min_len = float('inf') start = 0 while right < len(s): if s[right] in need: window[s[right]] = window.get(s[right], 0) + 1 if window[s[right]] == need[s[right]]: match += 1 while match == required: if right - left + 1 < min_len: min_len = right - left + 1 start = left if s[left] in need: window[s[left]] -= 1 if window[s[left]] < need[s[left]]: match -= 1 left += 1 right += 1 return s[start:start+min_len] if min_len != float('inf') else "" ``` Example usage: ``` s = "ADOBECODEBANC" t = "ABC" print(min_window(s, t)) # Output: "BANC" ```

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值