New Year Chaos: Hackerrank (Incomplete)

Solution.java

import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;

// https://www.hackerrank.com/challenges/new-year-chaos/copy-from/132089930
public class Solution {

    // Complete the minimumBribes function below.
    static void minimumBribes(int[] q) {
        boolean tooChaotic = false;

        for (int i = 1; i <= q.length; i++) {
            int diff = q[i - 1] - i;
            //System.out.println("i " + i + ": " + diff);
            if (diff >= 3) { 
                tooChaotic = true; 
                break;
            }
        }
        
        if (tooChaotic) {
            System.out.println("Too chaotic");
            return; 
        }

        int numBribes = 0;

        for (int i = 0; i < q.length; i++) {
            if (q[i] == i + 1) {
                continue;
            }
            
            if (q[i] < i + 1) {
                numBribes += (i + 1 - q[i]); 
            }
        }

        System.out.println(numBribes);
    }

    private static final Scanner scanner = new Scanner(System.in);

    public static void main(String[] args) {
        int t = scanner.nextInt();
        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

        for (int tItr = 0; tItr < t; tItr++) {
            int n = scanner.nextInt();
            scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

            int[] q = new int[n];

            String[] qItems = scanner.nextLine().split(" ");
            scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

            for (int i = 0; i < n; i++) {
                int qItem = Integer.parseInt(qItems[i]);
                q[i] = qItem;
            }

            minimumBribes(q);
        }

        scanner.close();
    }
}