leetcode 33 Search in Rotated Sorted Array

来源:互联网 发布:数据录取 编辑:程序博客网 时间:2024/05/21 12:48

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.

将折叠反转点与mid的位置关系考虑进去来确定两个端点的移动


0 0
原创粉丝点击