单调数列

问题描述：

样例输入：

代码如下：

package Leetcode;
import java.util.Scanner;
public class IsMonotonic {
    public static boolean isIncreace(int[] A) {
        for (int i = 1; i <A.length ; i++) {
            if (A[i]>=A[i-1]) continue;
            else return false;
        }
        return true;
    }
    public static boolean isDecreace(int[] A) {
        for (int i = 1; i <A.length ; i++) {
            if (A[i]<=A[i-1]) continue;
            else return false;
        }
        return true;
    }
    public static boolean isMonotonic(int[] A) {
        if (isDecreace(A)||isIncreace(A))
            return true;
        else return false;
    }

    public static void main(String[] args) {
        Scanner scanner=new Scanner(System.in);
        int len=scanner.nextInt();
        int []A=new int[len];
        for (int i = 0; i <len ; i++) {
            A[i]=scanner.nextInt();
        }
        System.out.println(isMonotonic(A));
    }
}

结果如下：