33. Search in Rotated Sorted Array

本文探讨了在已排序数组发生旋转后进行目标值搜索的问题,通过改进二分查找方法解决此挑战,强调了数组边界处理及判断条件的重要性。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

  1. Search in Rotated Sorted Array My Submissions Question
    Total Accepted: 92936 Total Submissions: 310089 Difficulty: Hard
    Suppose a sorted array 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.

Subscribe to see which companies asked this question

还是改了挺久的,二分查找的变形,数组边界处理要注意,判断条件也要注意

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

                else{
                    first=mid+1;
                    mid=(last+first)/2;
                }
            }
            else{
                if(nums[last-1]>=target && nums[mid]<target){
                    //之前一直wa的原因,nums[last]用作判断,越界
                    first=mid+1;
                    mid=(last+first)/2;
                }
                else{
                    last=mid;
                    mid=(last+first)/2;
                }
            }

        }
        return -1;
    }
};
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值