[LeetCode]Search in Rotated Sorted Array
2015-10-20 13:09
591 查看
Suppose a sorted array is rotated at some pivot unknown to you beforehand.
(i.e.,
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.
分析:二分查找,难度在于左右边界的确定。
class Solution {
public:
int search(int A[],int n,int target) {
int low = 0, high = n-1;
while (low != high){
const int mid = low + (high - low) / 2;
if (A[mid] == target)
return mid;
if (A[low] <= A[mid]){
if (A[low]<=target && A[mid]>target){
high = mid;
}
else
low = mid+1;
}
else{
if (target > A[mid] && target <= A[high]){
low = mid+1;
}
else{
high = mid;
}
}
}
return -1;
}
};
class Solution1 {
int binary_search(int A[], int low, int high, int target){
while (low <= high){
int mid = low + (high - low) / 2;
if (A[mid] == target)
return mid;
else if (A[mid] < target)
low = mid + 1;
else
high = mid - 1;
}
return -1;
}
public:
// assume it is an ascending array
int search(int A[], int n, int target) {
int low = 0, high = n - 1;
while (low <= high){
if (A[low] <= A[high]) // It will be satified at the end at least.
return binary_search(A, low, high, target);
int mid = low + (high - low) / 2;
if (A[mid] == target)
return mid;
else if (A[mid] < A[low]){
// [low, mid] is not ascending, [mid, high] is ascending
if (target > A[mid] && target <= A[high])
low = mid + 1;
else
high = mid - 1;
}
else{
// [low, mid] is ascending, [mid, high] is not ascending
if (target >= A[low] && target < A[mid])
high = mid - 1;
else
low = mid + 1;
}
}
return -1;
}
};
int main(){
Solution solution;
{
int a[] = { 4, 5, 6, 7, 0, 1, 2, };
int target = 5;
cout << solution.search(a, sizeof(a) / sizeof(a[0]), target)<<endl;
}
getchar();
return 0;
}
(i.e.,
0 1 2 4 5 6 7might become
4 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.
分析:二分查找,难度在于左右边界的确定。
class Solution {
public:
int search(int A[],int n,int target) {
int low = 0, high = n-1;
while (low != high){
const int mid = low + (high - low) / 2;
if (A[mid] == target)
return mid;
if (A[low] <= A[mid]){
if (A[low]<=target && A[mid]>target){
high = mid;
}
else
low = mid+1;
}
else{
if (target > A[mid] && target <= A[high]){
low = mid+1;
}
else{
high = mid;
}
}
}
return -1;
}
};
class Solution1 {
int binary_search(int A[], int low, int high, int target){
while (low <= high){
int mid = low + (high - low) / 2;
if (A[mid] == target)
return mid;
else if (A[mid] < target)
low = mid + 1;
else
high = mid - 1;
}
return -1;
}
public:
// assume it is an ascending array
int search(int A[], int n, int target) {
int low = 0, high = n - 1;
while (low <= high){
if (A[low] <= A[high]) // It will be satified at the end at least.
return binary_search(A, low, high, target);
int mid = low + (high - low) / 2;
if (A[mid] == target)
return mid;
else if (A[mid] < A[low]){
// [low, mid] is not ascending, [mid, high] is ascending
if (target > A[mid] && target <= A[high])
low = mid + 1;
else
high = mid - 1;
}
else{
// [low, mid] is ascending, [mid, high] is not ascending
if (target >= A[low] && target < A[mid])
high = mid - 1;
else
low = mid + 1;
}
}
return -1;
}
};
int main(){
Solution solution;
{
int a[] = { 4, 5, 6, 7, 0, 1, 2, };
int target = 5;
cout << solution.search(a, sizeof(a) / sizeof(a[0]), target)<<endl;
}
getchar();
return 0;
}
相关文章推荐
- libevent在windows下使用步骤详解
- [BZOJ1997][HNOI2010] 平面图判定
- PHP获取网页标题的代码
- 计算空间
- javaweb项目进行国际化碰到的问题
- 二、JavaScript语言--JS动画--JS动画效果
- 【网络编程系列】二:socket通信原理及实践
- finished with non-zero exit value -1073741819
- 有关AndroidStudio R文件错误的小结
- 组合索引,索引内过滤
- 企业级账号添加信任操作流程
- opencv2 读取16bit图像数据小结
- svn ci错误
- ActivityLifecycleCallbacks 对Activity的生命周期事件进行集中处理
- Project ERROR: Unknown module(s) in QT: xlsx
- [置顶] 读后有感 - 残忍但诚实的忠告:您没钱,就不要掺和这事了
- UIAlertController
- 今日之听讲座
- java基础 传递参数
- RecycleView三种表现形式的上拉加载和下拉刷新