转:http://bylijinnan.iteye.com/blog/1471461
public class SearchInShiftedArray {
/**
* 题目:给定一个固定长度的数组,将递增整数序列写入这个数组。当写到数组尾部时,返回数组开始重新写,并覆盖先前写过的数。
* 请在这个特殊数组中找出给定的整数。查找给定元素的位置
* 解答:
* 其实就是“旋转数组”。旋转数组的最小元素见http://bylijinnan.iteye.com/blog/1431531
* 采用类似二分查找的策略。首先比较a[0]和a[N/2],如果a[0] < a[N/2],则说明a[0,1,...,N/2]为递增子序列,否则另一部分是递增子序列。
* 然后判断要找的整数是否在递增子序列范围内。如果在,则使用普通的二分查找方法继续查找;如果不在,则重复上面的查找过程,直到找到或者失败为止。
*
*/
public static void main(String[] args) {
int[][] a={
{1,2,3,4,5},
{2,3,4,5,1},
{3,4,5,1,2},
{4,5,1,2,3},
{5,6,1,2,3,4},
};
for(int[] each:a){
int pos=find(each,0,each.length-1,4);
System.out.println(pos);
}
}
public static int find(int[] data,int low,int high,int target){
if(data==null||data.length==0){
return -1;
}
int len=data.length;
if(!(low>=0&&low<len&&high>=0&&high<len)){//0<=(low,high)<=len-1
return -1;
}
int mid=0;
while(low<=high){
if(data[low]<=data[high]){//if 'data' is already increasing排好序的 ,直接用二分查找
return binarySearch(data,low,high,target);
}
mid=(low&high)+(low^high)/2;
if(data[low]<=data[mid]){//if the first part is increasing
if(target>=data[low]&&target<=data[mid]){
return binarySearch(data,low,mid,target);
}else{
return find(data,mid,high,target);
}
}
if(data[mid]<=data[high]){//if the second part is increasing
if(target>=data[mid]&&target<=data[high]){
return binarySearch(data,mid,high,target);
}else{
return find(data,low,mid,target);
}
}
}
return -1;
}
public static int binarySearch(int[] data,int low,int high,int target){
if(data==null||data.length==0){
return -1;
}
int mid=0;
while(low<=high){
mid=(low&high)+(low^high)/2;
if(data[mid]==target){
return mid;
}else if(data[mid]<target){
low=mid+1;
}else{
high=mid-1;
}
}
return mid;
}
}