LeetCode·33. Search in Rotated Sorted Array

题目:

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

思路:

二分查找,判断最左和中间值的关系分情况讨论。

代码:

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int L = 0;
        int R = nums.size()-1;
        while(L <= R){
            int mid = (L+R)/2;
            if(nums[mid] == target)return mid;
            if(nums[L] <= nums[mid]){
                if(nums[L] <= target && nums[mid] > target)
                    R = mid-1;
                else
                    L = mid+1;
            }else{
                if(nums[L] > target && nums[mid] < target)
                    L = mid+1;
                else
                    R = mid-1;
            }
        }

        return -1;
    }
};

结果:


这里写图片描述

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值