class Solution {
    // Function to count total number of 1's in sorted binary array
    public int totalOnes(int[] arr, int n) {
        // Initialize answer
        int ans = 0;
        // Traverse the array
        for (int i = 0; i < n; i++) {
            // Found first occurrence of 1
            if (arr[i] == 1) {
                // Remaining elements are all 1's
                ans = n - i;
                // Stop further checking
                break;
            }
        }
        // Return the count of 1's
        return ans;
    }
}

public class Main {
    public static void main(String[] args) {
        // Create solution object
        Solution sol = new Solution();
        // Input array
        int[] binaryArray = {0, 0, 0, 1, 1, 1};
        // Print total 1's
        System.out.println("Total number of 1's: " + sol.totalOnes(binaryArray, 6));
    }
}

123456789101112131415161718192021222324

class Solution:
    # Function to count total number of 1's in sorted binary array
    def totalOnes(self, arr, n):
        # Initialize answer
        ans = 0
        # Traverse the array
        for i in range(n):
            # Found first occurrence of 1
            if arr[i] == 1:
                # Remaining elements are all 1's
                ans = n - i
                # Stop further checking
                break
        # Return the count of 1's
        return ans

if __name__ == "__main__":
    # Create solution object
    sol = Solution()
    # Input array
    binaryArray = [0, 0, 0, 1, 1, 1]
    # Print total 1's
    print("Total number of 1's:", sol.totalOnes(binaryArray, 6))

123456789101112131415161718192021222324252627282930

class Solution {
    // Function to count total number of 1's in sorted binary array
    totalOnes(arr, n) {
        // Initialize answer
        let ans = 0;
        // Traverse the array
        for (let i = 0; i < n; i++) {
            // Found first occurrence of 1
            if (arr[i] === 1) {
                // Remaining elements are all 1's
                ans = n - i;
                // Stop further checking
                break;
            }
        }
        // Return the count of 1's
        return ans;
    }
}

// Driver code
(function () {
    // Create solution object
    const sol = new Solution();
    // Input array
    const binaryArray = [0, 0, 0, 1, 1, 1];
    // Print total 1's
    console.log("Total number of 1's:", sol.totalOnes(binaryArray, 6));
})();