題目要求：

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.

題目地址：https://leetcode.com/problems/search-in-rotated-sorted-array/

?

public class Solution {public static int search(int[] A, int target) {int first=0,last=A.length-1,mid;while(first<=last){mid=(first+last)/2;System.out.println("當前搜索范圍"+A[first]+"--"+A[last]+",mid="+A[mid]);if(A[mid]==target)return mid;else if(A[first]<=A[mid]){//左有序if(target<A[first]||target>A[mid]){first=mid+1;}else{last=mid-1;}}else{//右有序if(target<A[mid]||target>A[last]){last=mid-1;}else{first=mid+1;}}}return -1;}
}

POINTS：和傳統2分查找無差別，只是通過A[mid]與A[first]A[last]的大小比較確定翻轉的奇異點在2段范圍中的哪一段，在對正常有序的那一段判斷下目標在不在其中。

轉載于:https://www.cnblogs.com/charlesdoit/p/4324148.html

總結

以上是生活随笔為你收集整理的leetcode:Search in Rotated Sorted Array的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。