剑指Offer LeetCode 面试题53 - I. 在排序数组中查找数字 I

class Solution {
    public int search(int[] nums, int target) {
        int sum=0;
        for(int i=0;i<nums.length;i++){
            if(nums[i]==target){
                sum++;
            }
        }
        return sum;
    }
}

/**
 * @Auther: truedei
 * @Date: 2020 /20-5-20 08:45
 * @Description:
 */
public class Test1 {
    static  public int search(int[] nums, int target) {
        int i=0;
        int j=nums.length-1;
        int left=0,right=0;
        //搜索左边界
        while (i<=j){
            int mid =  (i + j) /2;
            if(nums[mid] <= target)
                i = i + 1;
            else
                j = j - 1;
        }
        right = i;
        i = 0;
        j=nums.length-1;
        //搜索右边界
        while (i<=j){
            int mid =  (i + j) /2;
            if(nums[mid] < target)
                i = i + 1;
            else
                j = j - 1;
        }
        left=j;
        return right - left - 1;
    }
    public static void main(String[] args) {
        int nums[] = new int[]{5,7,7,8,8,10},target = 8;
        System.out.println(search(nums,target));
    }
}