1def longest_ones(nums, k):
2 left = 0
3 zeros = 0
4 max_len = 0
5 for right in range(len(nums)):
6 if nums[right] == 0:
7 zeros += 1
8 while zeros > k:
9 if nums[left] == 0:
10 zeros -= 1
11 left += 1
12 max_len = max(max_len, right - left + 1)
13 return max_len