C++算法 day_1 二分法查找

C++算法 day_1 二分法查找

leecode

class Solution{
 public:
	 int search(vector<int> &num1,int target){
		 int right =num1.size()-1; //右下标
		 int left =0;//左下标
		 while(left<=right){
		 int mid = (right+left)/2;
		 if(num1[mid] == target){
			 return mid;
		 }
		 else if(num1[mid]<target){
		     left = mid+1; 
		 }
		 else if(num1[mid]>target){
		     right = mid-1;
		 
		 }
	    }
		return -1;
	 }
};

		 int left =1;//从第一个开始
		 int right =n;

		 while(left <right){
		 		 int mid = left + (right - left) / 2; // 防止计算时溢出
				 if(isBadVersion(mid)){
				   right = mid;
				 }
				 else{
				   left=mid+1;
				 }
		 }
         return left;//一个点

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int n = nums.size();
        int l=0,r=n-1;
        while(l<=r){
            int mid=l+(r-l)/2;
            if(nums[mid]<target)
                l=mid+1;
            else r=mid-1;
        }
        return l;
    }
};