Number of zeros in a binary array

class Solution:
    def countZeroes(self, arr, N):
        start = 0
        end = N-1;
        
        if (arr[0] == 0): return N
        if (arr[0] == 1 and arr[1] == 0): return N-1
        if (arr[N-1] == 1): return 0
        
        while (start <= end):
            mid = start + (end-start)//2
            if (arr[mid] == 0 and arr[mid-1] == 1): return N-mid
            if (arr[mid] == 1 and arr[mid+1] == 0): return N-(mid+1)
            
            if (arr[mid] == 1 and arr[mid+1] == 1): start = mid+1
            else: end = mid-1
        return N

Source: grepper.com

Similar codes

0 vote305 views1 answer
Java console readline null pointer exception
Java
0 vote279 views1 answer
Set java time complexity
Java
0 vote279 views1 answer
Check if user has internet connection in kotlin
Java
0 vote305 views1 answer
Positive numbers in array
Java
4 votes292 views3 answers
Repository query spring boot
Java
0 vote315 views2 answers
Close GUI in jvava
Java
0 vote266 views1 answer
Why the fuck java suck
Java
0 vote285 views2 answers
Java convert am pm to 24 hour
Java
0 vote284 views1 answer
Keep jframe on top
Java
4 votes284 views3 answers
Java string to uuid
Java