Shulou(Shulou.com)06/01 Report--

This article shows you how to carry out rotation sort array analysis, the content is concise and easy to understand, can definitely brighten your eyes, through the detailed introduction of this article, I hope you can get something.

Suppose that an array sorted in ascending order is rotated at a pre-unknown point.

(for example, an array [0meme1reparent2magor455pyrr7] may become [4pyrrine 5rec 6pr 7jor0rec 1reie2]).

Searches for a given target value, and returns its index if it exists in the array, otherwise-1.

You can assume that there are no duplicate elements in the array.

The time complexity of your algorithm must be O (log n).

Example 1:

Input: nums = [, target = 0 output: 4

Example 2:

Input: nums = [, target = 3 output:-1 the above is how to carry out rotation sort array analysis, have you learned the knowledge or skills? If you want to learn more skills or enrich your knowledge reserve, you are welcome to follow the industry information channel.

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.