896. Monotonic Array
Posted xxinn
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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
【题意】
判断是否是单调数组。
【解答】
用两个bool变量分别记录是否出现neg差值和pos差值,单调数组的话,两个不可能同时为true。
时间O(N) 空间O(1)
class Solution { public: bool isMonotonic(vector<int>& A) { int len = A.size(); bool isNeg = false; bool isPos = false; for(int i=0; i+1<len; i++){ int diff = A[i+1] - A[i]; if(diff < 0){ isNeg = true; if(isPos) return false; } if(diff > 0){ isPos = true; if(isNeg) return false; } } return true; } };
以上是关于896. Monotonic Array的主要内容,如果未能解决你的问题,请参考以下文章
[LeetCode] 896. Monotonic Array 单调数组
js代码片段: utils/lcoalStorage/cookie
[TIA PORTAL][CONVERT] Convert Char Array to DInt...DInt to Char Array..Useful and easy function(代码片段