Search in Rotated Sorted Array
来源:互联网 发布:stc12c5a32s2数据手册 编辑:程序博客网 时间:2024/05/22 01:46
Search in Rotated Sorted Array
Suppose a sorted array is rotated at some pivot unknown to you beforehand.
(i.e., 0 1 2 4 5 6 7
might become4 5 6 7 0 1 2
).
You are given a target value to search. If found in the array return its index, otherwise return -1.
You may assume no duplicate exists in the array.
解题方法:
旋转数组查找,当然该题不可以自己用顺序查找的方式来查找。要充分利用旋转数组的性质。下面将给出旋转数组的类二分查找算法。
Code:
int Search(int A[],int n,int target){
int low=0,high=n;
while(low!=high){
const int mid=(low+high)/2;
if(A[mid]==target){
return mid;
}
if(A[low]<=A[mid]){
if(A[low]<=target && target<A[mid])
high=mid;
else
low=mid+1;
}else{
if(A[mid]<target && target<=A[high-1])
low=mid+1;
else
high=mid;
}
}
return -1;
}
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Android程序对不同手机屏幕分辨率自适应的总结
- 什么是匿名内部类什么时侯用?
- UVA - 10951 Polynomial GCD (最大公共多项式)
- 精彩BUG人生[4] -- bug free or not
- 网络监控工具弥补云监控短板
- Search in Rotated Sorted Array
- 【读书笔记】安卓异步任务
- 自定义的一些button样式
- 9--Linux学习----信号
- Remove Duplicates from Sorted Array
- 线索二叉树_legend
- lm8333添加键盘背光代码
- 如何在PC上查看一个web页面在移动端的展示效果
- C# 序列化和反序列化