Sword finger offer 53 - I. find the number I in the sorted array

Title Description

)

Problem analysis

The two methods
The first one is ： Violent settlement .
The second kind ： Use bisection search , Because it is a sorted array , For the value found , Let him judge whether it is equal , If equal, let count+1;

Code instance

class Solution {
    
    public int search(int[] nums, int target) {
    
        int lefet = 0,right = nums.length()-1,count = 0;
        while(left < right){
    
        	int mid = (left + right)/2;
        	if(nums[mid] >= target){
    
        		right = middle - 1;
        	}
        	if(nums[mid] < target){
    
        		left = middle + 1;
        	}
        }
        while(left < nums.length&&nums[left++] == target){
    
        	count++;
        }
        return count;
    }
}