Search in Rotated Sorted Array II

最新推荐文章于 2021-12-18 23:10:30 发布

Nereus_Li

最新推荐文章于 2021-12-18 23:10:30 发布

阅读量498

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/li_chihang/article/details/44409261

版权

LeetCode 专栏收录该内容

113 篇文章 0 订阅

订阅专栏

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.

bool Find(int A[], int first, int last,int target )
{
    int mid = (first + last) / 2;
	int leftbound = mid;
	int rightbound = mid;
	while (A[leftbound] == A[mid] && leftbound >= first)
		--leftbound;
	while (A[rightbound] == A[mid] && rightbound <= last)
		++rightbound;
	if (A[mid] == target)
		return true;
	else if (leftbound<first)
	{
		if (rightbound>last)
			return  false;
		else
			return Find(A, rightbound,last,target);
	}
	else
	{
		if (rightbound > last)
			return Find(A, first, leftbound, target);
		else
			return Find(A, rightbound, last, target) || Find(A, first, leftbound, target);
	}
}

bool search(int A[], int n, int target) {
	
	return Find(A, 0, n - 1, target);
}