Leetcode Golang 33. Search in Rotated Sorted Array.go

思路

类似二分查找的思路，每次需要判断前进的方向

code

func search(nums []int, target int) int {
	lo := 0
	hi := len(nums) - 1

	for lo < hi {
		mid := (lo + hi) / 2
		if nums[mid] == target {
			return mid
		}
		if nums[lo] <= nums[mid] {
			if target >= nums[lo] && target < nums[mid] {
				hi = mid - 1
			} else {
				lo = mid + 1
			}
		} else {
			if target > nums[mid] && target <= nums[hi] {
				lo = mid + 1
			} else {
				hi = mid - 1
			}
		}

	}
	if nums[lo] == target {
		return lo
	} else {
		return -1
	}
}

更多内容请移步我的repo：https://github.com/anakin/golang-leetcode