*题目链接: * LeetCode 33—Search in Rotated Sorted Array
AC代码:
public class Problem33 {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] ss={4,5,1,2,3};
System.out.println(search(ss, 0));
}
public static int search(int[] nums, int target) {
int p =-1,q=-1;
for(int i=0;i<nums.length;i++){
if(nums[i]==target) q=i;
if(i<nums.length-1){
if(nums[i]>nums[i+1]){
p=i;
}
}
else
p=nums.length-1;
}
if(q==-1) return -1;
else{
if(q<=p) return nums.length-p-1+q;
else return q-p-1;
}
}
}