Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

int findMin(vector<int>& nums) { int i=0,j=nums.size()-1; int mid=(i+j)/2; while(i<j){ if(nums[mid]>nums[j]) i=mid+1; else j=mid; mid=(i+j)/2; } return nums[mid]; }

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.