/**
* Suppose a sorted array is rotated at some pivot unknown to you beforehand.
* (i.e.,0 1 2 4 5 6 7might become4 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.
*
* 假设排序后的数组在您事先不知道的某个轴上旋转。
* (例如,0 1 2 4 5 6 7可能变成4 5 6 7 0 1 2)。
* 您将得到一个要搜索的目标值。如果在数组中找到,则返回其索引,否则返回-1。
* 您可以假定数组中不存在重复项。
*/
/** * Suppose a sorted array is rotated at some pivot unknown to you beforehand. * (i.e.,0 1 2 4 5 6 7might become4 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. * * 假设排序后的数组在您事先不知道的某个轴上旋转。 * (例如,0 1 2 4 5 6 7可能变成4 5 6 7 0 1 2)。 * 您将得到一个要搜索的目标值。如果在数组中找到,则返回其索引,否则返回-1。 * 您可以假定数组中不存在重复项。 */ public class Main44 { public static void main(String[] args) { int[] A = {0,1,2,3,4,6,7}; System.out.println(search(A, 1)); } public static int search(int[] A, int target) { int len = A.length; for (int i=0;i<len;i++) { if (A[i] == target) { return i; } } return -1; } }