Create Search in Rotated Sorted Array 

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.

上述方法其实不符合本体题意，该题题意我认为是想用二分查找的方式，但我一次就便利了，所以严格的说我的解法不对。