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 vote215 views1 answer
C:\elastic stack\elasticsearch-7.15.1-windows-x86_64\elasticsearch-7.15.1\bin>java -version java version "1.8.0_311" Java(TM) SE Runtime Environment (build 1.8.0_311-b11) Java HotSpot(TM) Client VM (build 25.311-b11, mixed mode, sharing)
Java
0 vote266 views1 answer
Splitting text with several condition in java
Java
2 votes200 views2 answers
Bukkit creating an inventory window
Java
0 vote193 views1 answer
Why to use serializable with java bean
Java
0 vote182 views1 answer
How to see java versions mac
Java
0 vote183 views1 answer
Why we use return method
Java
0 vote218 views1 answer
Spring application configuration example
Java
0 vote186 views1 answer
Quick select method for kth smallest element in java
Java
2 votes197 views1 answer
Java text ouput to console
Java
0 vote225 views1 answer
Change brightness of image in java
Java