LeetCode-081-搜索旋转排序数组 II

搜索旋转排序数组 II

解法一：二分查找法

public class LeetCode_081 {
    public static boolean search(int[] nums, int target) {
        if (nums.length == 1) {
            if (nums[0] == target) {
                return true;
            } else {
                return false;
            }
        }
        // 最大值的位置
        int maxIndx = -1;
        for (int i = 0; i < nums.length - 1; i++) {
            if (nums[i] > nums[i + 1]) {
                maxIndx = i;
                break;
            }
        }
        int result;
        if (target <= nums[nums.length - 1]) {
            result = find(nums, maxIndx + 1, nums.length - 1, target);
        } else {
            result = find(nums, 0, maxIndx, target);
        }
        return result != -1;
    }

    /**
     * 二分查找
     *
     * @param nums
     * @param left
     * @param right
     * @param target
     * @return
     */
    public static int find(int[] nums, int left, int right, int target) {
        int mid;
        while (left <= right) {
            mid = (left + right) / 2;
            if (nums[mid] == target) {
                return mid;
            } else if (nums[mid] < target) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }
        return -1;
    }

    public static void main(String[] args) {
        int[] nums = new int[]{2, 5, 6, 0, 0, 1, 2};
        System.out.println(search(nums, 3));
    }
}