package leetcode;

/**
 * https://leetcode.com/problems/global-and-local-inversions/
 */
public class Problem775 {
    public boolean isIdealPermutation(int[] A) {
        // TODO
        return false;
    }

    public static void main(String[] args) {
        Problem775 prob = new Problem775();
    }
}

@@ -291,16 +291,179 @@
 m775();%0A
+        System.out.println(prob.isIdealPermutation(new int%5B%5D%7B1, 0, 2%7D)); // true%0A        System.out.println(prob.isIdealPermutation(new int%5B%5D%7B1, 2, 0%7D)); // false%0A
     %7D%0A%7D%0A

Update problem 775