leetcode#33. Search in Rotated Sorted Array

原创于 2020-03-26 06:50:04 发布 · 118 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

查找专栏收录该内容

2 篇文章

订阅专栏

本文介绍了一种在旋转排序数组中查找目标值的高效算法。数组可能在某个未知位置旋转，如[0,1,2,4,5,6,7]变为[4,5,6,7,0,1,2]。算法需在O(logn)时间内运行，避免重复元素，通过二分查找解决。示例：输入[4,5,6,7,0,1,2]，目标0，输出4；目标3，输出-1。

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

一共有三种情况
12345678
67812345 //后半段前置
45678123 // 前半段后置

可以运用二分查找

class Solution {//运用二分查找
    public int search(int[] nums, int target) {
        if(nums == null || nums.length == 0) return -1;
        int left =0, right = nums.length -1;
        while(left <= right){ 
            int mid = left + (right - left)/2;
            if(nums[mid] == target){
                return mid;
            }
            
            else if(nums[mid] < nums[left]){ // 后半段转到前半段
                if(target > nums[mid] && target <= nums[right]){
                    left = mid + 1;
                }
                else{
                    right = mid -1;
                }
            }else{// 后半段放前半段
                if(target < nums[mid] && target >= nums[left]){
                    right = mid -1;
                }
                else{
                    left = mid +1;
                }
            }
        }
        return -1;
    }
}