山脉序列中的最大值

山脉序列中的最大值

题目：

描述
给 n 个整数的山脉数组，即先增后减的序列，找到山顶（最大值）。

数组严格递增，严格递减

样例
例1:
输入: nums = [1, 2, 4, 8, 6, 3] 
输出: 8

例2:
输入: nums = [10, 9, 8, 7], 
输出: 10

解题思路：找出第一个nums[i] > nums[i + 1]的数即可

public class Solution {
    /**
     * @param nums: a mountain sequence which increase firstly and then decrease
     * @return: then mountain top
     */
    public int mountainSequence(int[] nums) {
        // write your code here
        int len = nums.length;
        if(len == 1) {
            return nums[0];
        }

        int l = 0, r = len - 1;
        while(l <= r) {
            int mid = l + (r - l) / 2;
            if(nums[mid] > nums[mid + 1]) {
                r = mid - 1;
            } else {
                l = mid + 1;
            }
        }

        return nums[l];
    }
}

public class Solution {
    /**
     * @param nums: a mountain sequence which increase firstly and then decrease
     * @return: then mountain top
     */
    public int mountainSequence(int[] nums) {
        // write your code here
        int len = nums.length;
        if(len == 1) {
            return nums[0];
        }

        int l = 0, r = len;
        while(l < r) {
            int mid = l + (r - l) / 2;
            if(nums[mid] > nums[mid + 1]) {
                r = mid;
            } else {
                l = mid + 1;
            }
        }

        return nums[l];
    }
}