LeetCode Search in Rotated Sorted Array II

最新推荐文章于 2020-08-30 11:00:31 发布

原创最新推荐文章于 2020-08-30 11:00:31 发布 · 977 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一个在含有重复元素的旋转有序数组中查找特定目标值的算法。通过使用修改后的二分查找方法，该算法能够在对数时间内确定目标值是否存在。文章提供了一个C++实现示例。

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

Search in Rotated Sorted Array II

Total Accepted: 18488 Total Submissions: 59914 My Submissions

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.

#include <iostream>

using namespace::std;

bool search(int A[], int n, int target){
	int first=0, end=n;
	while(first < end){
		int middle = (first+end)/2;
		if(A[middle] == target){
			return true;
		}
		if(A[first] < A[middle]){
			if(target >= A[first] && target < A[middle]){
				end = middle;
			}else{
				first = middle+1;
			}
		}else if(A[first] > A[middle]){
			if(target > A[middle] && target <= A[end-1]){
				first = middle+1;
			}else{
				end = middle;
			}
		}else{
			first ++;
		}
	}
	return false;
}

int main()
{
	int A[]={1,1,1,2,2,3};
	bool flag = search(A, 6, 2);
	cout << flag << endl;
	
	return 0;
}