1067 Sort with Swap(0, i) java

Given any permutation of the numbers {0, 1, 2,..., N−1}, it is easy to sort them in increasing order. But what if Swap(0, *) is the ONLY operation that is allowed to use? For example, to sort {4, 0, 2, 1, 3} we may apply the swap operations in the following way:

Swap(0, 1) => {4, 1, 2, 0, 3}
Swap(0, 3) => {4, 1, 2, 3, 0}
Swap(0, 4) => {0, 1, 2, 3, 4}

Now you are asked to find the minimum number of swaps need to sort the given permutation of the first N nonnegative integers.

Input Specification:

Each input file contains one test case, which gives a positive N (≤10​5​​) followed by a permutation sequence of {0, 1, ..., N−1}. All the numbers in a line are separated by a space.

Output Specification:

For each case, simply print in a line the minimum number of swaps need to sort the given permutation.

Sample Input:

10
3 5 7 2 6 4 9 0 8 1

Sample Output:

9

import java.util.Scanner;

public class Main {
    /**
     * 无论是BufferedReader还是Scanner
     * 第二组和第三组测试都会超时
     * */
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int[] num = new int[n];
        int sum = n - 1;
        for (int i = 0; i < n; ++i) {
            num[i] = scanner.nextInt();
            if (num[i] == i && i != 0) {
                // 记录一共有多少个没有在本位置上的数据
                --sum;
            }

        }
        int k = 1, count = 0, temp = 0;
        while (sum > 0) {
            if (num[0] == 0) {
                while (k < n) {
                    if (num[k] != k) {
                        temp = num[0];
                        num[0] = num[k];
                        num[k] = temp;
                        ++count;
                        break;
                    }
                    ++k;
                }
            }
            while (num[0] != 0) {

                temp = num[0];
                num[0] = num[temp];
                num[temp] = temp;
                ++count;
                --sum;
            }

        }
        System.out.println(count);

    }
}