MonotonicArray.java

package com.leetcode.algorithms.easy.array;

import java.util.Scanner;

import com.leetcode.util.InputUtil;

public class MonotonicArray {
	
	public static void main(String...strings) {
		// Input
		Scanner scanner = new Scanner(System.in);
		String[] inputs = InputUtil.inputArr(scanner.next());
		int[] A = InputUtil.integerArr(inputs);
		
		// Check if array is monotonic
		System.out.println(isMonotonic(A));
		
		scanner.close();
	}
	
	public static boolean isMonotonic(int[] A) {
		if(A.length == 0) {
			return true;
		} else {
			if(A.length == 1) {
				return true;
			} else {
				int countMonotonicOrder = 0;
				
				// Check for ascending order
				for(int i = 0; i < A.length - 1; i++) {
					if(A[i + 1] >= A[i]) {
						++countMonotonicOrder;
					}
				}
				
				if(countMonotonicOrder == A.length - 1) {
					return true;
				}
				
				countMonotonicOrder = 0;
				
				// Check for descending order
				for(int i = 1; i < A.length; i++) {
					if(A[i - 1] >= A[i]) {
						++countMonotonicOrder;
					}
				}
				
				if(countMonotonicOrder == A.length - 1) {
					return true;
				}
				
				return false;
			}
		}
    }

}