Non-decreasing Array LeetCode solution in Java

1
class Solution {
2
  public boolean checkPossibility(int[] nums) {
3
    int modified = 0, prev = nums[0], index = 0;
4
    for (; index < nums.length; ++index) {
5
      if (nums[index] < prev) {
6
        if (++modified > 1) return false;
7
        if (index - 2 >= 0 && nums[index - 2] > nums[index]) continue;
8
      }
9
      prev = nums[index];
10
    }
11
    return true;
12
  }
13
}