You are given an integer array nums of length n which represents a permutation of all the integers in the range [0, n - 1]. The number of global inversions is the number of the different pairs (i, j) where: 0 nums[j] The number of local inversions is the number of indices i where: 0 nums[i + 1] Return true if the number of global inversions is equal to the number of local inversions.