April 13, 2010 in Uncategorized 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). How do you find an element in the rotated array efficiently? You may assume no duplicate exists in the array. Note: I have updated the problem description to assume that there exists no duplicate in the array. Some readers have noted that the below code does not work for input with duplicates. For example, for input "1 2 1 1 1 1″, the binary search method below would not work,
Read full article from Searching an Element in a Rotated Sorted Array | LeetCode
No comments:
Post a Comment