LeetCode_33---Search in Rotated Sorted Array

package From21;

/**
 * @author MohnSnow
 * @time 2015年6月16日 上午11:23:40
 * @HideTags 二分查找 数组
 */

public class LeetCode33 {
	//304msA ----- 一次性编写加通过----兴奋---就是代码量太多
	public static int search(int[] nums, int target) {
		int len = nums.length;
		int i = 0, j = 1;
		if (nums.length == 0) {
			return -1;
		}
		if (nums[0] == target) {
			return 0;
		} else if (nums[0] < target) {
			while (j < len && nums[j] >= nums[i]) {
				if (nums[j] == target) {
					return j;
				}
				i++;
				j++;
			}
			return -1;
		} else {
			i = len - 1;
			j = len - 2;
			if (nums[i] == target) {
				return i;
			}
			while (j >= 0 && nums[j] <= nums[i]) {
				if (nums[j] == target) {
					return j;
				}
				i--;
				j--;
			}
			return -1;
		}
	}
	//省略j,变为340msA
	public static int search1(int[] nums, int target) {
		int len = nums.length;
		int i = 0;
		if (nums.length == 0) {
			return -1;
		}
		if (nums[0] == target) {
			return 0;
		} else if (nums[0] < target) {
			while (i + 1 < len && nums[i + 1] >= nums[i]) {
				if (nums[i + 1] == target) {
					return i + 1;
				}
				i++;
			}
			return -1;
		} else {
			i = len - 1;
			if (nums[i] == target) {
				return i;
			}
			while (i - 1 >= 0 && nums[i - 1] <= nums[i]) {
				if (nums[i - 1] == target) {
					return i - 1;
				}
				i--;
			}
			return -1;
		}
	}

	public static void main(String[] args) {
		int[] nums = { 3 };
		int target = 3;
		System.out.println("寻找：" + search(nums, target));
		System.out.println("寻找1：" + search1(nums, target));
	}
}

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.

Hide Tags

  Array Binary Search

翻译：

Code: