Leetcode sword offer find the number I (nine) in the sorted array

Title Description

Count the number of times a number appears in the sort array .

Example 1:

 Input : nums = [5,7,7,8,8,10], target = 8 
 Output : 2

Example 2:

 Input : nums = [5,7,7,8,8,10], target = 6
 Output : 0

 Python3 Code implementation

Realization way ： Two points search

class Solution:
    def search(self, nums: List[int], target: int) -> int:
        return self.binary_search(nums, 0, len(nums)-1, target)
    
    def binary_search(self, nums, low, high, target):
        if low <= high:
            mid = low + (high - low) // 2
            if nums[mid] == target:
                return self.binary_search(nums, low, mid-1, target) + self.binary_search(nums, mid+1, high, target) + 1
            elif nums[mid] > target:
                return self.binary_search(nums, low, mid-1, target)
            else:
                return self.binary_search(nums, mid+1, high, target)
        return 0

C++ Code implementation

Realization way ： Two points search

class Solution {
public:
    int search(vector<int>& nums, int target) {
        return binary_search(nums, 0, nums.size()-1, target);
    }

public:
    int binary_search(vector<int>& nums, int low, int high, int target){
        if(low <= high){
            int mid = static_cast<int>(low + (high - low) / 2);
            if(nums[mid] == target){
                return binary_search(nums, low, mid-1, target) + binary_search(nums, mid+1, high, target) + 1;
            }
            else if(nums[mid] > target){
                return binary_search(nums, low, mid-1, target);
            }
            else{
                return binary_search(nums, mid+1, high, target);
            }
        }
        return 0;
    }
};