[LeetCode] 896. Monotonic Array 单调数组
Posted grandyang
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LeetCode] 896. Monotonic Array 单调数组相关的知识,希望对你有一定的参考价值。
An array is?monotonic?if it is either monotone increasing or monotone decreasing.
An array?A
?is monotone increasing if for all?i <= j
,?A[i] <= A[j]
.? An array?A
?is monotone decreasing if for all?i <= j
,?A[i] >= A[j]
.
Return?true
?if and only if the given array?A
?is monotonic.
Example 1:
Input: [1,2,2,3]
Output: true
Example 2:
Input: [6,5,4,4]
Output: true
Example 3:
Input: [1,3,2]
Output: false
Example 4:
Input: [1,2,4,5]
Output: true
Example 5:
Input: [1,1,1]
Output: true
Note:
1 <= A.length <= 50000
-100000 <= A[i] <= 100000
Github 同步地址:
https://github.com/grandyang/leetcode/issues/896
参考资料:
https://leetcode.com/problems/monotonic-array/
LeetCode All in One 题目讲解汇总(持续更新中...)
以上是关于[LeetCode] 896. Monotonic Array 单调数组的主要内容,如果未能解决你的问题,请参考以下文章