2021-04-24打卡

image.png

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

image.png

class Solution {
    public int findPeakElement(int[] nums) {
        int left =0,right = nums.length-1;
        while(left < right){
            int mid = left+(right-left)/2;
            if(nums[mid] > nums[mid+1]){
                right = mid;
            }else{
                left = mid + 1;
            }
        }
        return left;
    }
}