global-and-local-inversions.cpp

// Time:  O(n)
// Space: O(1)

class Solution {
public:
    bool isIdealPermutation(vector<int>& A) {
        for (int i = 0; i < A.size(); ++i) {
            if (abs(A[i] - i) > 1) {
                return false;
            }
        }
        return true;
    }
};