Find Max In Rotated Sorted Array (medium)

class Solution { public: int findMin(vector<int>& nums) { int n = nums.size() - 1; if (nums[0] <= nums[n]) { return nums[0]; } int l = 0, r = n, m = 0; while(l <= r) { ...