leetcode/153-find-minimum-in-rotated-sorted-array/find-minimum-in-rotated-sorted-array.ts at main · fyfirman/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
/**
  key idea: different logic to put the num
 */

function findMin(nums: number[]): number {
  let left = 0, right = nums.length - 1;

  while(left<right){
    const mid = Math.floor((left+right)/2);

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

  }

  return nums[left];
};