leetcode-896-easy

Monotonic Array
思路一: 遍历

public boolean isMonotonic(int[] nums) {
    boolean increase = true;
    for (int i = 0; i < nums.length - 1; i++) {
        if (nums[i] > nums[i + 1]) {
            increase = false;
            break;
        }
    }

    boolean decrease = true;
    for (int i = 0; i < nums.length - 1; i++) {
        if (nums[i] < nums[i + 1]) {
            decrease = false;
            break;
        }
    }

    return increase || decrease;
}
posted @ 2022-10-19 21:17  iyiluo  阅读(20)  评论(0)    收藏  举报