LeetCode - Search in Rotated Sorted Array - Python

题目：You are given a target value to search. If found in the array return its index, otherwise return -1.

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 may assume no duplicate exists in the array.

知识：数组、二分搜索

分析：二分搜索的变形。

注意：判断二分区间的单调性，以便正确去掉一半的区间，缩小搜索范围。

Python实现：

欢迎继续讨论，共同进步！