Maximum Count of Positive Integer and Negative Integer.py

from bisect import bisect_left, bisect_right
from typing import List


class Solution:
    """
    Time:   O(log2(n))
    Memory: O(1)
    """

    def maximumCount(self, nums: List[int]) -> int:
        negative = bisect_left(nums, 0)
        positive = len(nums) - bisect_right(nums, 0)
        return max(negative, positive)