牛客网-《剑指offer》-旋转数组的最小数

题目:http://www.nowcoder.com/practice/9f3231a991af4f55b95579b44b7a01ba

C++

 1 class Solution {
 2 public:
 3     int minNumberInRotateArray(vector<int> arr) {
 4         int len = arr.size();
 5         if (len == 0) return 0;
 6         int ret = arr[0];
 7         for (int i = 1; i < len; i++) {
 8             if (arr[i] < ret) return arr[i];
 9         }
10         return ret;
11     }
12 };
原文地址:https://www.cnblogs.com/CheeseZH/p/5112873.html