public int search(int[] nums, int target) {
return binright(nums,target)-binleft(nums,target)+1;
}
public int binleft(int[] nums,int x){
int l=0,r=nums.length-1,mid=0;
while (l<=r){
mid=(l+r)/2;
System.out.println(mid);
if(nums[mid]
釜山行2
链接:https://pan.baidu.com/s/1DMiWu352e1BErFgvUYYcBg
提取码:6ujd