clueless coding // TODO: be smarter

LeetCode Find Minimum in Rotated Sorted Array: CPP Solution



TL;DR Code Solution


int findMin(vector<int>& nums) {

    int left = 0;
    int right = nums.size() - 1;

    while (left < right) {

        if (nums[left] < nums[right]) return nums[left];

        int mid = (left + right) / 2;
        if (nums[mid] >= nums[left]) {
            left = mid + 1;
        }
        else {
            right = mid;
        }
    }

    return nums[left];

}