Ai
1 Star 2 Fork 5

LilithSangreal/LeetCode-Solutions

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
minimum-window-substring.py 1.20 KB
一键复制 编辑 原始数据 按行查看 历史
Allen Liu 提交于 2018-10-13 13:04 +08:00 . update
# Time: O(n)
# Space: O(k), k is the number of different characters
class Solution(object):
def minWindow(self, s, t):
"""
:type s: str
:type t: str
:rtype: str
"""
current_count = [0 for i in xrange(52)]
expected_count = [0 for i in xrange(52)]
for char in t:
expected_count[ord(char) - ord('a')] += 1
i, count, start, min_width, min_start = 0, 0, 0, float("inf"), 0
while i < len(s):
current_count[ord(s[i]) - ord('a')] += 1
if current_count[ord(s[i]) - ord('a')] <= expected_count[ord(s[i]) - ord('a')]:
count += 1
if count == len(t):
while expected_count[ord(s[start]) - ord('a')] == 0 or \
current_count[ord(s[start]) - ord('a')] > expected_count[ord(s[start]) - ord('a')]:
current_count[ord(s[start]) - ord('a')] -= 1
start += 1
if min_width > i - start + 1:
min_width = i - start + 1
min_start = start
i += 1
if min_width == float("inf"):
return ""
return s[min_start:min_start + min_width]
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/LilithSangreal/LeetCode-Solutions.git
git@gitee.com:LilithSangreal/LeetCode-Solutions.git
LilithSangreal
LeetCode-Solutions
LeetCode-Solutions
master

搜索帮助