LeetCode 2529. 正整数和负整数的最大计数 C#
原题链接
简单
作者:
hpstory
,
2023-01-10 09:56:56
,
所有人可见
,
阅读 96
C# 代码
public class Solution {
public int MaximumCount(int[] nums) {
int n = nums.Length;
int left = 0, right = n - 1;
while (left < right){
int mid = left + right + 1 >> 1;
if (nums[mid] >= 0) right = mid - 1;
else left = mid;
}
if (left == n - 1) return n;
int neg = nums[0] == 0 ? 0 : left + 1;
right = n - 1;
while (left < right){
int mid = left + right >> 1;
if (nums[mid] > 0) right = mid;
else left = mid + 1;
}
int pos = nums[n - 1] == 0 ? 0 : n - left;
return Math.Max(neg, pos);
}
}