用Java编码时如何避免TLE？

// Java Program to illustrate a Hack to Avoid TLE while
// coding
// Importing required libraries
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
// Main Class
class GFG {
    // Method 1
    // To find the minimum number of swaps required
    static int minimumSwaps(int[] arr)
    {
        // Declaring and initializing variables to 0
        // Swap and Index variable
        int swap = 0, index = 0;
        // Creating object of HashMap class for storing
        // array elements along with corresponding current
        // position in the input array
        // Declaring both the objects if Integer type
        HashMap<Integer, Integer> index_table
            = new HashMap<>();
        for (int i = 0; i < arr.length; i++) {
            index_table.put(arr[i], i);
        }
        // Loop variable beginning from 0 so the element
        // that should be present at index i after sorting
        // is, i+1 Hence we check if arr[i] is equal to i+1
        // or not
        for (int i = 0; i < arr.length; i++) {
            // Condition check for figuring out correct
            // element
            if (arr[i] != (i + 1))
            {
                // If the above condition is not fulfilled
                // i.e, if arr[i]!=i+1 that means the
                // correct element needs to be swapped with
                // the current one.
                // Find the index of the element i+1 from
                // the hashmap
                index = index_table.get(i + 1);
                // Swapping the element
                arr[index] = arr[i];
                arr[i] = i + 1;
                // Variable keeping a count of the number of
                // swaps
                swap++;
                // Updating the hashmap
                index_table.put(arr[i], i);
                index_table.put(arr[index], index);
            }
        }
        // Returning the swap counts
        return swap;
    }
    // Scnnere Class object to take unput from user
    private static final Scanner scanner
        = new Scanner(System.in);
    // Method 2
    // Main driver method
    public static void main(String[] args)
        throws IOException
    {
        // Creating an object of BufferedWriter to read
        // input fro te use
        BufferedWriter bufferedWriter = new BufferedWriter(
            new FileWriter(System.getenv("OUTPUT_PATH")));
        // Storing the non-primitive datatype
        // Here, Integer value
        int n = scanner.nextInt();
        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
        // Creating arrays
        // Array 1
        // Creating an Integer array o size N
        int[] arr = new int[n];
        // Array 2
        // Creating an String array
        String[] arrItems = scanner.nextLine().split(" ");
        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
        for (int i = 0; i < n; i++) {
            int arrItem = Integer.parseInt(arrItems[i]);
            arr[i] = arrItem;
        }
        int res = minimumSwaps(arr);
        bufferedWriter.write(String.valueOf(res));
        // Getting to new line
        bufferedWriter.newLine();
        // No further input will be accepted
        // isong the close()  method
        bufferedWriter.close();
        // Closing the inputs
        scanner.close();
    }
}


4 3 1 2 5


3