题目:
一、有序循环数组查找(无重复元素)。
有序数组如:01234 ,则 23401是一个有序循环数组
思路:
二分查找,关键idea是:如果A[i]>=A[j]则【i,j】是有序的。
abcdefg
mid = ‘d’
如果abcd有序,target不在abcd中,则对abc操作;如果target不在abcd中,则对efg操作
如果abcd无序,说明defg有序,如果target在defg中,则对defg操作;如果不在defg中,则对abc操作
T(n)=T(n/2)+O(1)
public class Solution {
public int search(int[] nums, int target)
{
int start = 0,end = nums.length-1;
while(start<=end)
{
int mid = (start+end)/2;
if(target == nums[mid]){return mid;}
if(nums[start]<=nums[mid])//说明start-mid之间是有序的
{
if(nums[start]<=target && target<nums[mid])
{
end = mid-1;
}else
start = mid+1;
}else
{
if(target>nums[mid] && target<=nums[end])
{
start = mid+1;
}else
end = mid-1;
}
}
return -1;
}
}
二、有序循环数组查找(有重复元素)。
比如 1111211 是一个有序循环数组,如果a[j]>=a[i],则不能说明【ij】有序,因为a[j] = a[i]的影响。
此时可以把问题分为2部分
1、a[j]>a[i]则同上
2、a[j]=a[i],遍历i++,直到a[i]=target,或者a[i] !=a[j]
public class Solution {
public boolean search(int[] nums, int target) {
int start = 0,end = nums.length-1;
while(start<=end)
{
int mid = (start+end)/2;
if(target == nums[mid]){return true;}
if(nums[mid]>nums[start])
{
if(target>=nums[start] && target<nums[mid])
{
end = mid-1;
}else
{
start = mid+1;
}
}else
if(nums[mid] == nums[start])
{
while(start<=mid)
{
if(nums[start] == target){return true;}
if(nums[start] != nums[mid])
{
break;
}
start++;
}
}else
{
if(target>nums[mid] && target<=nums[end])
{
start = mid+1;
}else
end = mid-1;
}
}
return false;
}
}