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

Editor to share with you how golang leetcode skills to achieve sorting deformation, I believe that most people do not know much about it, so share this article for your reference, I hope you can learn a lot after reading this article, let's go to know it!

Find the minimum value in a rotated sorted array

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]).

Please find the smallest element.

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

Example 1:

Input: [3, 4, 5, 5, 1, 2]

Output: 1

Example 2:

Input: [4, 5, 6, 7, 0, 0, 1, 2]

Output: 0

Ideas for solving the problem:

1, because the two parts are still in order, we can search them in two parts.

2, if arr [mid]

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.