LeetCode 3149: Find the Minimum Cost Array Permutation Solution

class Solution {
    int minCost = Integer.MAX_VALUE;
    int[] result;

    public int[] minCostArrayPermutation(int[] nums) {
        int n = nums.length;
        boolean[] visited = new boolean[n];
        int[] currentPerm = new int[n];

        generatePermutations(nums, visited, currentPerm, 0);

        return result;
    }

    private void generatePermutations(int[] nums, boolean[] visited, int[] currentPerm, int index) {
        if (index == nums.length) {
            int cost = calculateCost(currentPerm, nums);
            if (cost < minCost) {
                minCost = cost;
                result = currentPerm.clone();
            }
            return;
        }

        for (int i = 0; i < nums.length; i++) {
            if (!visited[i]) {
                visited[i] = true;
                currentPerm[index] = i;
                generatePermutations(nums, visited, currentPerm, index + 1);
                visited[i] = false;
            }
        }
    }

    private int calculateCost(int[] perm, int[] nums) {
        int cost = 0;
        for (int i = 0; i < perm.length; i++) {
            cost += Math.abs(i - nums[perm[i]]);
        }
        return cost;
    }
}