NIO 2007
某次科研调查时得到了n个自然数,每个数均不超过1500000000(1.5*109)。已知不相同的数不超过10000个,现在需要统计这些自然数各自出现的次数,并按照自然数从小到大的顺序输出统计结果。
import java.util.*; public class Main{ public static void main(String[]args) { Scanner input =new Scanner(System.in); int n= input.nextInt(); int []ant=new int[n]; for(int i=0;i<n;i++) { ant[i]= input.nextInt(); } Arrays.sort(ant); HashMap<Integer,Integer> map=new HashMap<>(); for(int i:ant) { if(map.containsKey(i)) { int ans= map.get(i); ans++; map.put(i,ans); } else { map.put(i,1); } } Set<Integer> num=map.keySet(); Object [] ob = num.toArray(); Arrays.sort(ob); for(Object h:ob) { System.out.println(h+" "+map.get(h)); } } }
在蓝桥评测系统中需要OI 流才可以完全通过所有测试数据
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.*; public class Main { static long nums[] = new long[200000]; static Map<Integer,Integer> countMap = new HashMap<>(); public static void main(String[] args) throws IOException { BufferedReader sc = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.valueOf(sc.readLine()); for (int i = 0; i < n; i++) { int tem = Integer.valueOf(sc.readLine()); if (!countMap.containsKey(tem)){ countMap.put(tem,1); }else { int a = countMap.get(tem); countMap.put(tem,++a); } nums[i] = tem; } Object[] objects = countMap.keySet().toArray(); Arrays.sort(objects); for (Object obj : objects) { System.out.println((int)obj+" "+countMap.get(obj)); } } }
标签:map,java,HashMap,int,countMap,集合,new,tem From: https://www.cnblogs.com/liliczw2209/p/17173715.html