首页 > 代码库 > LeetCode Search in Rotated Sorted Array

LeetCode Search in Rotated Sorted Array

2024-07-26 04:32:31   223人阅读

Search in Rotated Sorted Array

 Total Accepted: 27955 Total Submissions: 97929My Submissions

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.




int search(int A[], int n, int target){
	
	int first=0, end=n;
	while(first < end){
		int middle = (first+end)/2;
		if(A[middle] == target){
			return middle;
		}
		if(A[first] <= A[middle]){
			if(target >= A[first] && target < A[middle]){
				end = middle;
			}else{
				first = middle+1;
			}
		}else{
			if(target > A[middle] && target <= A[end-1]){
				first = middle+1;
			}else{
				end = middle;
			}
		}
	}
	return -1;
}







Discuss

LeetCode Search in Rotated Sorted Array


联系
我们