1 class Solution {
2 public boolean isMonotonic(int[] A) {
3 if(A.length == 0) return false;
4 if(A.length == 1 || A.length == 2) return true;
5 int j = 0, flag = 0;
6 while(j < A.length - 1){
7 if(A[j] > A[j+1]){
8 flag = 1;
9 break;
10 }else if(A[j] < A[j+1]){
11 flag = -1;
12 break;
13 }
14 j++;
15 }
16
17
18 for(int i = 0; i < A.length-1; i++){
19 if(flag == 1){
20 if(A[i] < A[i+1]){
21 return false;
22 }
23 }else if(flag == -1){
24 if(A[i] > A[i+1]){
25 return false;
26 }
27 }
28 }
29 return true;
30
31 }
32 }
