LeetCode No 153 寻找旋转序列中的最小值
题目
错误代码:
class Solution {
public:
int findMin(vector<int>& nums) {
if(nums.size() == 1) return nums[0];
int lo = 0, hi = nums.size() - 1;
while(lo <= hi) {
int mi = lo + (hi - lo)/2;
if(nums[(mi