2529_MaximumCountofPositiveIntegerandNegativeInteger - a920604a/leetcode GitHub Wiki

class Solution {
public:
    int maximumCount(vector<int>& nums) {
        int ne_count = 0, pos_count = 0;
        for(int n:nums){
            if(n < 0) ne_count++;
            else if(n > 0) pos_count++;
        }
        return max(ne_count, pos_count);
        
    }
};

class Solution {
public:
    int maximumCount(vector<int>& nums) {
        int n = nums.size();
        // find first position large than 0 
        int l = 0, r = n;
        while(l<r){
            int mid = l + (r-l)/2;
            if(nums[mid] <= 0 ) l = mid +1;
            else r = mid;
        }
        l = r-1;
        while(l> -1 && nums[l] ==0) l--;
        
        return max(n-r, l+1);
        
    }
};