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.

Author: bhuvanonymous

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