201312-1 CCF CSP 出现次数最多的数

import java.util.*;

public class Main{
   public static void main(String args[]){
   Scanner scanner = new Scanner(System.in);

   int n = scanner.nextInt();
   int[] a = new int[n];
   int[] num = new int[n];
   for(int i = 0;i<n;i++){
    a[i]=scanner.nextInt();
    num[i] = 0;
   }
   for (int i = 0; i < a.length; i++) {
		for (int j = 0; j < a.length - i - 1; j++) {
			if (a[j] > a[j + 1]) {
				int num1 = a[j];
				a[j] = a[j + 1];
				a[j + 1] = num1;
			}
		}
	//	System.out.println(a[i]);
   }
   for (int i = 0; i < a.length; i++) {
	for (int j = i; j < a.length; j++) {
		if (a[i]==a[j]) {
			num[i]++;
		}
	}
	//System.out.println(num[i]);
   }
   int temp=0;
   int max=num[0];
   for (int i = 0; i < num.length; i++) {	
	   if (max<num[i]) {
		max=num[i];
		temp=i;
	}
}
   System.out.println(a[temp]);

 }
}