Leetcode33. 搜索旋转排序数组

题目：

---

代码(首刷自解 2024年3月8日)：

class Solution {
public:
    int search(vector<int>& nums, int target) {
        // 找到数组中k,nums[k] > nums[k + 1]
        int n = nums.size();
        int k = n - 1;
        int left = 0, right = nums.size() - 1;
        int mid;
        int rightestVal = nums[right];
        while (left <= right) {
            mid = left + (right - left) / 2;
            if (nums[mid] < rightestVal) {
                right = mid - 1;
            } else {
                while (mid + 1 < n && nums[mid + 1] > rightestVal) {
                    ++mid;
                }
                k = mid;
                break;
            }
        } 
        // 若target >= nums[0] 在 0~k中二分搜索,否则在 k + 1, n - 1 中二分搜索
        if (target >= nums[0]) {
            return BinSerach(nums, target, 0, k);
        }
        return BinSerach(nums, target, k + 1, n - 1);
    }
    int BinSerach(const vector<int>& nums, int target, int left, int right) {
        int mid;
        while (left <= right) {
            mid = left + (right - left) / 2;
            if (target < nums[mid]) {
                right = mid - 1;
            } else if (target > nums[mid]) {
                left = mid + 1;
            } else {
                return mid;
            }
        }
        return -1;
    }
};

---

代码（二刷看解析 2024年7月30日）

class Solution {
public:
    // 注意几个等号
    int search(vector<int>& nums, int target) {
        int left = 0, right = nums.size() - 1;
        while (left <= right) {
            int mid = left + (right - left) / 2;
            if (nums[mid] == target) return mid;
            if (nums[mid] >= nums[0]) { // 0-mid有序
                if (nums[0] <= target && target < nums[mid])
                    right = mid - 1;
                else
                    left = mid + 1;
            } else { //mid-right有序
                if (nums[mid] < target && target <= nums[right])
                    left = mid + 1;
                else
                    right = mid - 1;
            }
        }
        return -1;
    }
};