Global and Local Inversions LeetCode solution in Java

1
class Solution {
2
  public boolean isIdealPermutation(int[] nums) {
3

4
    for (int i = 0; i < nums.length; i++) {
5
      if (Math.abs(nums[i] - i) > 1) return false;
6
    }
7

8
    return true;
9
  }
10
}