Monotonic Array LeetCode solution in Java

1
class Solution {
2
  public boolean isMonotonic(int[] nums) {
3
    if (nums[0] < nums[nums.length - 1]) {
4
      for (int i = 0; i < nums.length - 1; i++) {
5
        if (!(nums[i] <= nums[i + 1])) return false;
6
      }
7
    } else {
8
      for (int i = 0; i < nums.length - 1; i++) {
9
        if (!(nums[i] >= nums[i + 1])) return false;
10
      }
11
    }
12
    return true;
13
  }
14
}