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
思路:找到不相同的元素,首先判断是递增还是递减,然后判断后面是否有违反规则的元素;
class Solution {
public boolean isMonotonic(int[] A) {
if(A == null || A.length == 0) {
return false;
}
int i = 1;
// skip same elements;
while(i < A.length) {
if(A[i - 1] != A[i]) {
break;
}
i++;
}
// 如果跳出去了,证明全部一样,return true;
if(i == A.length) {
return true;
}
boolean increase = (A[i - 1] < A[i]);
for(; i < A.length; i++) {
if(increase && (A[i - 1] > A[i]) || !increase && A[i - 1] < A[i]) {
return false;
}
}
return true;
}
}