목록76. Minimum Window Substring (1)

Scribbling

LeetCode: 76. Minimum Window Substring

First: O(N) solution. However, is_satisfied function is not very efficient. class Solution: def minWindow(self, s, t): ret = '' from collections import Counter c = Counter(t) chars = c.keys() j = 0 for i, char in enumerate(s): if char in chars: c[char] -= 1 if self.is_satisfied(c): if not ret or (i - j + 1)
Computer Science/Coding Test 2021. 9. 30. 00:32
이전 Prev 1 Next 다음