leetcode
leetcode copied to clipboard
Published
20 hours ago •
tech-cow
tech-cow
Sliding Windows
209. Minimum Size Subarray Sum
class Solution(object):
def minSubArrayLen(self, target, nums):
globalMin = float('inf')
curSum = 0
j = 0
for i in range(len(nums)):
while j < len(nums) and curSum < target:
curSum += nums[j]
j += 1
if curSum >= target:
globalMin = min(globalMin, j - i)
curSum -= nums[i]
return globalMin if globalMin != float('inf') else 0
3. Longest Substring Without Repeating Characters
class Solution(object):
def lengthOfLongestSubstring(self, s):
globalMax = -float('inf')
globalSet = set()
j = 0
for i in range(len(s)):
while j < len(s) and s[j] not in globalSet:
globalSet.add(s[j])
globalMax = max(globalMax, len(globalSet))
j += 1
globalSet.remove(s[i])
return globalMax if globalMax != -float('inf') else 0