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
解决
判断数组是否单调递增或单调递减。
假设数组长度为n
。
- 时间复杂度:O(n)
- 空间复杂度:O(1)
class Solution {
public:
bool isMonotonic(vector<int>& A) {
int n = A.size();
int increase = 0;
int decrease = 0;
int same = 0;
for (int i = 1; i < n; i++) {
if (A[i] > A[i - 1]) {
increase++;
} else if (A[i] < A[i - 1]) {
decrease++;
} else {
same++;
}
}
if ((same == n - 1) || (increase && !decrease) || (!increase && decrease)) {
return true;
} else {
return false;
}
}
};