g0801_0900.s0896_monotonic_array.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.41

package g0801_0900.s0896_monotonic_array;

// #Easy #Array #Programming_Skills_II_Day_1 #2022_03_28_Time_2_ms_(86.21%)_Space_94_MB_(5.42%)

/**
 * 896 - Monotonic Array\.
 *
 * Easy
 *
 * An array is **monotonic** if it is either monotone increasing or monotone decreasing.
 *
 * An array `nums` is monotone increasing if for all `i <= j`, `nums[i] <= nums[j]`. An array `nums` is monotone decreasing if for all `i <= j`, `nums[i] >= nums[j]`.
 *
 * Given an integer array `nums`, return `true` _if the given array is monotonic, or_ `false` _otherwise_.
 *
 * **Example 1:**
 *
 * **Input:** nums = [1,2,2,3]
 *
 * **Output:** true 
 *
 * **Example 2:**
 *
 * **Input:** nums = [6,5,4,4]
 *
 * **Output:** true 
 *
 * **Example 3:**
 *
 * **Input:** nums = [1,3,2]
 *
 * **Output:** false 
 *
 * **Constraints:**
 *
 * *   1 <= nums.length <= 10⁵
 * *   -10⁵ <= nums[i] <= 10⁵
**/
public class Solution {
    public boolean isMonotonic(int[] nums) {
        int i = 0;
        for (; i < nums.length - 1; i++) {
            if (nums[i] > nums[i + 1]) {
                break;
            }
        }
        if (i == nums.length - 1) {
            return true;
        }
        i = 0;
        for (; i < nums.length - 1; i++) {
            if (nums[i] < nums[i + 1]) {
                break;
            }
        }
        return i == nums.length - 1;
    }
}