class Solution {
    
    
    public int search(int[] nums, int target) {
    
    
        if (nums == null || nums.length == 0) return 0;
        int l = 0,r = nums.length - 1;
        while (l < r) {
    
    
            int mid = l + r >> 1;
            if (nums[mid] >= target) r = mid;
            else l = mid + 1;
        }
        int left = l;
        if (nums[l] != target) return 0;
        else{
    
    
            l = 0;
            r = nums.length - 1;
            while (l < r) {
    
    
                int mid = l + r + 1 >> 1;
                if (nums[mid] <= target) l = mid;
                else r = mid - 1; 
            }
        int right = l;
        int res = right - left + 1;
        return res;
        } 
    }
}