CCF部分真题代码(Java)绪论.doc

2013-12-1//出现次数最多的数 package demo; import java.util.*; public class Test2{ public static void main(String[] args){ new Test2().run(); } public void run(){ System.out.println(请输入：); @SuppressWarnings(resource) Scanner fin = new Scanner(System.in); int N =fin.nextInt(); int[]count = new int[10001]; for(int i=0;iN;++i){ ++count[fin.nextInt()]; } int maxCount =-1; int result = 0; for (int i=1;i=10000;++i){ if(count[i]maxCount){ maxCount=count[i]; result = i; } } System.out.println(result); } } 2014-03-01//相反数 package