solution/0700-0799/0775.Global and Local Inversions/Solution.java at main

main

leetcode-clojure

403 issues
2 pull requests
5,000 files
1 active branch

List view

solution\0700-0799\0775.Global and Local Inversions\Solution.java

3 Complexity
3 Complexity / M
0 Duplication
1 Churn
12 Lines
12 Lines of Code
1 Methods
12 LOC / Method

class Solution {
    public boolean isIdealPermutation(int[] nums) {
        int mx = 0;
        for (int i = 2; i < nums.length; ++i) {
            mx = Math.max(mx, nums[i - 2]);
            if (mx > nums[i]) {
                return false;
            }
        }
        return true;
    }
}