【剑指Offer53-Ⅰ.在排序数组中查找数字】

题目：

今天这题使用二分查找加速即可。
不过我都忘了C++还有upper_bound和lower_bound这两个函数了。直接相减就可以得到对应的数量。
C++代码：

class Solution {
public:
    int search(vector<int>& nums, int target) {
        return (upper_bound(nums.begin(), nums.end(), target)-lower_bound(nums.begin(), nums.end(), target));
    }
};

class Solution {
public:
    int search(vector<int>& nums, int target) {
    	if(nums.size()==0){
    		return 0;
		}
    	int count = 0;
		int left = 0;
		int right = nums.size()-1;
		int mid = 0;
		int flag = 0;
		while(left<=right){
			mid = left + (right - left)/2;
			if(nums[mid]==target){
				flag = 1;
				break;
			}
			if(nums[mid]>target){
				right = mid-1;
			}
			else if(nums[mid]<target){
				left = mid+1;
			}
		}
		
		if(flag==0){
			return 0;
		}
		
		int i = mid-1;
		int j = mid;
		while(i>=0&&nums[i]==target){
			count++;
			i--;
		}
		while(j<=nums.size()-1&&nums[j]==target){
			count++;
			j++;
		}
		
		
		return count;
    }
};