LeetCode(33)-Search in Rotated Sorted Array

来源:互联网 发布:java设计模式spring 编辑:程序博客网 时间:2024/05/16 09:46

问题描述:

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.


问题分析:


问题求解:

0 0
原创粉丝点击