Given a rotated sorted array `nums` of distinct values, implement `findMin(nums)` returning the minimum element.
+ 1 hidden test run on Submit.
Binary search comparing mid to the right end finds the rotation minimum in O(log n).
Run your code to see results.