LeetCode Find Minimum in Rotated Sorted Array

1.题目

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

Find the minimum element.

You may assume no duplicate exists in the array.

2.解决方案

class Solution {
public:
    int findMin(vector<int> &num) {
        if(num[0] <= num[num.size() - 1]){
            return num[0];
        }
        
        int leftIndex = 0;
        int rightIndex = num.size() - 1;