Follow up for "Search in Rotated Sorted Array":
What if duplicates are allowed?
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.
用二分法,但是有其他考量。
考虑 [1,3,1,1] 与 [1,1,1,3,1] 都取 target 为 1。
当头==中时,此时该转向左边还是右边呢?
一个小问题却增加了 complexity。
class Solution {
public:
bool search(int A[], int n, int target) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
//二分法
if(n==0) return false;
if(n==1) return (A[0]==target);
int mid = n/2;
if(A[0] == target||A[mid]==target||A[n-1]==target)
{
return true;
}
if(A[mid]==A[0])
{
return search(A+n/2,n-n/2,target)||search(A,n/2,target);
}
else if(A[mid]<A[0])
{
if(A[0]<target || target<A[mid])
{
return search(A,n/2,target);
}
else
{
return search(A+n/2,n-n/2,target);
}
}
else
{
if(A[mid]>target && A[0]<target)
{
return search(A,n/2,target);
}
else
{
return search(A+n/2,n-n/2,target);
}
}
}
};