問題：
方法：
題目中復(fù)雜度要求為O(logn)压储，所以使用變種二分查找草丧，要根據(jù)值的大小重置二分區(qū)間辣卒。
package com.eric.leetcode
class SearchInRotatedSortedArray {
fun search(nums: IntArray, target: Int): Int {
var start = 0
var end = nums.lastIndex
while (start <= end) {
val pivot = (start + end) / 2
if (nums[pivot] == target) {
return pivot
} else if (nums[start] <= nums[pivot]) {
if (target <= nums[pivot] && target >= nums[start]) {
end = pivot - 1
} else {
start = pivot + 1
}
} else {
if (target >= nums[pivot] && target <= nums[end]) {
start = pivot + 1
} else {
end = pivot - 1
}
}
}
return -1
}
}
fun main() {
val input = intArrayOf(4, 5, 6, 7, 8, 1, 2, 3)
val searchInRotatedSortedArray = SearchInRotatedSortedArray()
searchInRotatedSortedArray.search(input, 8)
}
有問題隨時(shí)溝通
