• Home
• com.github.javadev
• leetcode-in-java
• 1.38
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0801_0900.s0896_monotonic_array.readme.md Maven / Gradle / Ivy

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 <= 105
*   -105 <= nums[i] <= 105