2529. 正整数和负整数的最大计数

代码实现：

class Solution:
    def maximumCount(self, nums: List[int]) -> int:
        def lower_bound(val):
            left, right = -1, len(nums)
            while left + 1 < right:
                mid = (left+right) // 2
                if nums[mid] < val:
                    left = mid
                else:
                    right = mid
            return right
        zero_index = lower_bound(0)
        n_neg = zero_index
        while n_neg > 1 and nums[n_neg-1] == 0:
            n_neg -= 1
        ori_zero_index = zero_index
        while zero_index < len(nums) and nums[zero_index] == 0:
            zero_index += 1
        n_pos = len(nums) - zero_index
        return max(n_neg, n_pos)

class Solution:
    def maximumCount(self, nums: List[int]) -> int:
        left, right = bisect_left(nums, 0), bisect_right(nums, 0)
        return max(0, left, len(nums)-right)