https://leetcode.cn/problems/maximum-count-of-positive-integer-and-negative-integerclassSolution{publicintmaximumCount(int[]nums){//思路:由于数组非递减,考虑logn实现//因此可以有二段性可以二分//即寻找正数和负数的分界点t