search in rotated sorted array

题目

Suppose an array sorted in ascending order 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.

Your algorithm's runtime complexity must be in the order of O(log n).

Example 1:

Input: nums = [4,5,6,7,0,1,2], target = 0
Output: 4

Example 2:

Input: nums = [4,5,6,7,0,1,2], target = 3
Output: -1

我的代码

package main

import "fmt"

func search(nums []int, target int) int {

	if len(nums) == 0 {
		return -1
	}
	var start, end = 0, len(nums) - 1
	var mid int
	for end-start > 1 {
		mid = (start + end) / 2
		if targetInMidBefore(nums, start, end, mid, target) {
			end = mid
		} else if targetInMidAfter(nums, start, end, mid, target) {
			start = mid
		} else {
			return -1
		}
	}
	if nums[start] == target {
		return start
	} else if nums[end] == target {
		return end
	}
	return -1
}

func targetInMidBefore(nums []int, start, end, mid, target int) bool {
	if nums[start] < nums[mid] && target <= nums[mid] && target >= nums[start] {
		return true
	}
	if nums[start] > nums[mid] && (target < nums[mid] || target >= nums[start]) {
		return true
	}
	return false
}

func targetInMidAfter(nums []int, start, end, mid, target int) bool {
	if nums[mid] > nums[end] && (nums[end] >= target || target >= nums[mid]) {
		return true
	}
	if nums[mid] < nums[end] && nums[end] >= target && nums[mid] <= target {
		return true
	}
	return false
}

func main() {
	fmt.Println(search([]int{2, 3, 0, 1}, 0))
	fmt.Println(search([]int{2, 3, 0, 1}, 1))
	fmt.Println(search([]int{2, 3, 0, 1}, 2))
	fmt.Println(search([]int{2, 3, 0, 1}, 3))
	fmt.Println(search([]int{4, 5, 6, 7, 0, 1, 2}, 0))
}