33. Search in Rotated Sorted Array

2024-04-12 09:11:35

description:

一个数列，不知道在哪翻转了一下，现在给定一个值，如果他在这个翻转后的数列里， return 它对应的 index
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).
Note:

Example:

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

answer:

class Solution {
public:int search(vector<int>& nums, int target) {int left = 0, right = nums.size() - 1;while (left <= right) {int mid = left + (right - left) / 2;if (nums[mid] == target) return mid;if (nums[mid] < nums[right]) {//较之于普通的二分查找，增加了中轴值得判断if (nums[mid] < target && nums[right] >= target) left = mid + 1;else right = mid - 1;} else {if (nums[mid] > target && nums[left] <= target) right = mid - 1;else left = mid + 1;}}return -1;}
};

relative point get√：

hint :

转载于:https://www.cnblogs.com/forPrometheus-jun/p/11095370.html

33. Search in Rotated Sorted Array相关推荐

LeetCode 33. Search in Rotated Sorted Array
问题链接 LeetCode 33. Search in Rotated Sorted Array 题目解析给定一个 "升序" 的无重复数组,从中寻找目标值."升序& ...
[Leetcode] 33. Search in Rotated Sorted Array 解题报告
题目: Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 ...
【leetcode】33. Search in Rotated Sorted Array
题目如下: 解题思路:题目要求时间复杂度是O(log n),而且数组也是有序的,那么可以考虑采用二分查找法.那么解题的关键就是找出转折点,找到了转折点后,把数组拆分成两段,再分别用二分查找,即可得到答 ...
Search in Rotated Sorted Array - 循环有序数组查找问题
两道题 33. Search in Rotated Sorted Array https://leetcode.com/problems/search-in-rotated-sorted-array/ ...
62. Search in Rotated Sorted Array【medium】
62. Search in Rotated Sorted Array[medium] Suppose a sorted array is rotated at some pivot unknown t ...
leetcode 81 Search in Rotated Sorted Array II ----- java
Follow up for "Search in Rotated Sorted Array": What if duplicates are allowed? Would this ...
LeetCode Online Judge 题目C# 练习 - Search in Rotated Sorted Array II
Follow up for "Search in Rotated Sorted Array": What if duplicates are allowed? Would this ...
【leetcode】Search in Rotated Sorted Array II（middle）☆
Follow up for "Search in Rotated Sorted Array": What if duplicates are allowed? Would this ...
LeetCode Search in Rotated Sorted Array II
Follow up for "Search in Rotated Sorted Array": What if duplicates are allowed? Would t ...

最新文章

热门文章