leetcode-896-easy
Monotonic Array
思路一: 遍历
public boolean isMonotonic(int[] nums) {
boolean increase = true;
for (int i = 0; i < nums.length - 1; i++) {
if (nums[i] > nums[i + 1]) {
increase = false;
break;
}
}
boolean decrease = true;
for (int i = 0; i < nums.length - 1; i++) {
if (nums[i] < nums[i + 1]) {
decrease = false;
break;
}
}
return increase || decrease;
}

浙公网安备 33010602011771号