統(tǒng)計(jì)一個(gè)數(shù)字在排序數(shù)組中出現(xiàn)的次數(shù)。

?

示例 1:

輸入: nums = [5,7,7,8,8,10], target = 8
輸出: 2
示例?2:

輸入: nums = [5,7,7,8,8,10], target = 6
輸出: 0
?

限制：

0 <= 數(shù)組長(zhǎng)度 <= 50000

?

代碼：

class?Solution?{

????public?int?search(int[]?nums,?int?target)?{

????????if(nums.length==0)

????????{

????????????return?0;

????????}

????????int?left?=?0,right?=?nums.length-1;

????????int?mid?=?left?+(right-left)/2;

????????while(left<right)

????????{

????????????mid?=?left+(right-left)/2;

????????????if(nums[mid]<target)

????????????{

????????????????left?=?mid?+?1;

????????????}

????????????else

????????????{

????????????????right?=?mid;

????????????}

????????}

????????int?a?=?left;

????????left?=?0;

????????right?=?nums.length-1;

????????while(left<right)

????????{

????????????mid?=?(right-left)/2+left;

????????????if(nums[mid]<=target)

????????????{

????????????????left?=?mid+1;

????????????}

????????????else{

????????????????right?=?mid;

????????????}

????????}

????????if(nums[right]==target)

????????{

????????????return?right-?a+1;

????????}

????????else

????????{

????????????return?right?-?a;

????????}

????}

}

總結(jié)

以上是生活随笔為你收集整理的【剑指offer】面试题53 - 1:在排序数组中查找数字 I(java)的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。