leetcode 081 Search in Rotated Sorted Array II

最新推荐文章于 2020-06-27 10:28:57 发布

walter1990

最新推荐文章于 2020-06-27 10:28:57 发布

阅读量280

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode

本文链接：https://blog.youkuaiyun.com/suichen1/article/details/51338659

Leetcode 专栏收录该内容

127 篇文章

订阅专栏

本文探讨了在含有重复元素的旋转有序数组中查找特定目标值的方法。通过调整二分搜索算法来处理旋转数组的问题，并考虑了重复元素对时间复杂度的影响。

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

Follow up for "Search in Rotated Sorted Array":
What if duplicates are allowed?

Would this affect the run-time complexity? How and why?

Write a function to determine if a given target is in the array.

Subscribe to see which companies asked this question

class Solution {
public:
    bool search(vector<int>& nums, int target) {
        int len = nums.size();

		if(len==0) return -1;

		int pivot=0, i=0;

		for(i=1; i<len; i++) {
			if(nums[i] < nums[i-1]) {
			    pivot=i;
			    break;
			}
		}

		int left = 0, end = len-1;

		if(target < nums[pivot]) return false;
		if(pivot-1>=0 && target>nums[pivot-1]) return false;

		if(pivot-1 >=0 && target >= nums[0] && target <= nums[pivot-1]) {
			left = 0;
			end = pivot-1;
		} else {
			left = pivot;
			end = len-1;
		}

		while(left <= end) {
			int mid = (left+end)/2;
			if(target==nums[mid]) return true;
			else if(target > nums[mid]) {
				left = mid+1;
			} else {
				end = mid-1;
			}
		}

		return false;
    }
};