From 21ac9c7d4faec1d5f7698357edcb8b4e9bd91916 Mon Sep 17 00:00:00 2001 From: Bhuvanachandra G Date: Tue, 2 Jul 2024 11:05:07 +0530 Subject: [PATCH] Update Max Consecutive Ones III - Leetcode 1004.py Use if statement instead of while to get back one zero to find the next maximum consecutive subsequence of 1. --- Max Consecutive Ones III - Leetcode 1004.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Max Consecutive Ones III - Leetcode 1004.py b/Max Consecutive Ones III - Leetcode 1004.py index 7fd929b..c279f25 100644 --- a/Max Consecutive Ones III - Leetcode 1004.py +++ b/Max Consecutive Ones III - Leetcode 1004.py @@ -9,7 +9,7 @@ def longestOnes(self, nums: List[int], k: int) -> int: if nums[r] == 0: num_zeros += 1 - while num_zeros > k: + if num_zeros > k: if nums[l] == 0: num_zeros -= 1 l += 1