算法3：二分查找（上）

特点：容易写出死循环
侧重：不一定需要数组有序，重点在于规律

二分查找

4个细节

在排序数组中查找元素的第一个和最后一个位置

• 法1：

复用上次的代码，先找到一个目标值的下标，在朝两边扩散即可

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

上面的方法时间复杂度为O(N),当所有数都是目标值的时候，将会遍历整个数组，当然快的原因就是这算是经过logN级算法优化的；

• 法2：
  分开求左右端点，注重理解
  左右端点
  

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        if (nums.size() == 0)    return {-1, -1};
        
        int begin = 0;
        int left = 0, right = nums.size() - 1, mid = 0;
        // 1.find left
        while (left < right) {
            mid = left + (right - left) / 2;
            if (nums[mid] < target)
                left = mid + 1;
            else
                right = mid;
        }
        if (nums[left] != target)	return {-1, -1};
        
        begin = left;
        // 2.find right
        right = nums.size() - 1;
        while (left < right) {
            mid = left + (right - left + 1) / 2;
            if (nums[mid] > target)
                right = mid -1;
            else
                left = mid;
        }
        return {begin, left};
    }
};

x的平方根

class Solution {
public:
    int mySqrt(int x) {
        if(x < 1)   return 0;
        int left = 1, right = x;
        while(left < right)
        {
                long long mid = left + (right - left + 1) / 2;
                if(mid * mid <= x)  left = mid;
                else right = mid -1;
        }
        return left;
    }
};

搜索插入位置

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

山脉数组的峰顶索引

1.暴力解法
2.

class Solution {
public:
    int peakIndexInMountainArray(vector<int>& arr) {
        int left = 1, right = arr.size() - 2;
        while(left < right)
        {
            int mid = left + (right - left) / 2;
            if(arr[mid] < arr[mid + 1])
                left = mid + 1;
            else
                right = mid;
        }
        return left;
    }
};