Sort with Swap(0, i)（java）

7-16 Sort with Swap(0, i)（25 分）

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

思路：

1、跟表排序很类似，不过这里其实不需要排序。只需要数有多少环就行了。

2、从a[0]开始，数环。包含0的环需要环内元素个数减1次交换，不包含0的环，需要环内元素加1次交换。环内只有一个元素就不需要交换了。

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
		in.nextToken();
		int n = (int) in.nval;
		int a[] = new int[n];
		int start = 0;
		
		for(int i =0;i<n;i++) {
			in.nextToken();
			a[i] = (int) in.nval;
			if(a[i]==0)
				start = i;
		}
		
		int count=0;
		int p = 0;
		for(int i =0;i<n;i++) {
			int point=i;
			int temp;
			while(a[point]!=point) {
				temp =a[point];
				a[point] =point;
				point = temp;
				p++;
			}
			if(p!=0&&i==0) {
				count = p-1;
				p=0;
			}	
			if(p!=0&&i!=0) {
				count+=p+1;
				p=0;
			}
		}
		
		System.out.print(count);
	}

}