leetcode33

题目
这道题主要就是需要观察规律，旋转数组一定存在左边是升序或者右边是升序的情况，根据该情况进行分类讨论即可
第一步就是区分那一边的数组是升序还是无序

class Solution {
        public int search(int[] nums, int target) {
            int left = 0;
            int right = nums.length - 1;
            while (left <= right) {
                int mid = (right - left) / 2 + left;
                if (nums[mid] == target) {
                    return mid;
                }
                //左边升序，注意需要是 >=
                if (nums[mid] >= nums[left]) {
                    if (nums[left] <= target && target <= nums[mid]) {
                        right = mid - 1;
                    } else {
                        left = mid + 1;
                    }
                } else {
                    if (nums[mid] <= target && target <= nums[right]) {
                        left = mid + 1;
                    } else {
                        right = mid - 1;
                    }
                }
            }
            return -1;
        }
    }