【leetcode】153. find minimum in rotated sorted array

public int (int[] nums){
        if (nums.length == 1) {
            return nums[0];
        }
        for (int i = 1; i < nums.length; i++) {
            if (nums[i] < nums[i - 1]) {
                return nums[i];
            }
        }
        return nums[0];
    }

public int (int[] nums) {
  int low = 0;
  int high = nums.length - 1;
  while (low < high) {
  int mid = low + (high - low) / 2;
  if (nums[mid] < nums[low] && nums[mid] < nums[high] && nums[mid] < nums[mid - 1]) {
  return nums[mid];
  } else {
  if (nums[low] <= nums[mid] && nums[mid] > nums[high] ) {
  
  low = mid + 1;
  } else{
  //最小的在左边
  high = mid - 1;
  }
  }
  }
  return nums[low];
  }

public int (int[] nums) {
  int low = 0, high = nums.length - 1;
  while (low < high) {
  int mid = low + (high - low) / 2;
  if (nums[mid] < nums[high])
  high = mid;
  else if (nums[mid] > nums[high])
  low = mid + 1;
  }
  return nums[low];
  }