Search in Rotated Sorted Array
来源:互联网 发布:自学java 编辑:程序博客网 时间:2024/05/05 19:17
Suppose a sorted array is rotated at some pivot unknown to you beforehand.
(i.e., 0 1 2 4 5 6 7
might 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.
时间复杂度O(n)public int search(int[] A, int target) {
for(int i=0;i<A.length;i++){
if(target==A[i])
return i;
}
return -1;
}
二分法:
public class Solution {
public int search(int[] A,int target){int first=0,mid,last=A.length;
while(first!=last){
mid=(first+last)/2;
if(target==A[mid])return mid;
if (A[first] <= A[mid]) {
if (A[first] <= target && target < A[mid])//有序部分
last = mid;
else
first = mid + 1;
} else {
if (A[mid] < target && target <= A[last-1])//有序部分
first = mid + 1;
else
last = mid;
}
}
return -1;
}
}
0 0
- 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
- Sharpui企业版-资源结构【04】 【QQ群:206378966】
- STM8S提示错误信息的原因及解决办法
- Java IO流的文件操作例程
- 使用Library管理Jar包
- 黑马程序员——IO流复制文件
- Search in Rotated Sorted Array
- 有名的博客,订阅软件,API文档
- 链表知识点(二)【单链表的插入操作】
- CART算法原理及实现
- 职场新人应该怎么理财呢?
- spark任务调度
- UVA 1423 - Guess
- C#操作EXCEL
- javaWeb-day02(Schema 约束)