LeetCode--No.33--Search in Rotated Sorted Array

最新推荐文章于 2021-01-09 18:54:08 发布

sophia_tone2w

最新推荐文章于 2021-01-09 18:54:08 发布

阅读量81

点赞数

分类专栏： LeetCode--Medium Leetcode

本文链接：https://blog.csdn.net/sophia_tone2w/article/details/90051425

版权

Leetcode 同时被 2 个专栏收录

39 篇文章 0 订阅

订阅专栏

LeetCode--Medium

24 篇文章 0 订阅

订阅专栏

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).

You are given a target value to search. If found in the array return its index, otherwise return -1.

You may assume no duplicate exists in the array.

Your algorithm's runtime complexity must be in the order of O(log n).

Example 1:

Input: nums = [4,5,6,7,0,1,2], target = 0
Output: 4

Example 2:

Input: nums = [4,5,6,7,0,1,2], target = 3
Output: -1

感觉是一道非常基本的题了，其实就是binary search呀，只不过稍微变形了一下，但是我却写了这么多的bug出来，可见binary search掌握得多不熟练，各种corner case都考虑不到，最后拼拼凑凑，改来改去，终于有了下面这个破破的代码。

class Solution {
    public int search(int[] nums, int target) {
        if (nums == null || nums.length == 0 )  return -1;
        return searchHelp(nums, target, 0, nums.length - 1);
    }
    private int searchHelp(int[] nums, int target, int start, int end){
        int mid = (start + end) / 2;
        if (target == nums[mid])    return mid;
        else if (start >= end)  return -1;
        if (nums[mid] >= nums[start]){
            if (nums[mid] > target && nums[start] <= target)
                return searchHelp(nums, target, start, mid-1);
            else
                return searchHelp(nums, target, mid + 1, end);
        }
        else{
            if (nums[mid] < target && nums[end] >= target)
                return searchHelp(nums, target, mid, end);
            else
                return searchHelp(nums, target, start, mid - 1);
        }
    }
}

所以说对于binary search/recursive的话，最先决定的，一定是终止条件。在这里就是return了-1或者return了某个值.