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

115 votes196 views6 answers
Reverse a string
Java
5 votes145 views1 answer
Change java version command line debian
Java
0 vote139 views1 answer
Android java how to stop users fromgoing back too much
Java
2 votes258 views1 answer
Replace all occurrences of a character in a string java
Java
0 vote135 views2 answers
Required a bean of type 'org.springframework.mail.javamail.JavaMailSender
Java
1 vote154 views2 answers
How to uninstall java openjdk in linux
Java
0 vote156 views4 answers
Duckduckgo
Java
1 vote141 views1 answer
Binary Search Ascending Order Sorted Array
Java
0 vote153 views1 answer
1 elemenet array java
Java
0 vote196 views1 answer
Spring converter in initbinder
Java