개발 관련 공부/알고리즘

백준 1302 베스트셀러

슴새 2021. 8. 20. 22:37
반응형

import java.util.*;

public class Main {
	 
	public static void main(String[] args) {
	
		 
		 Scanner sc=new Scanner(System.in);
		 int n=sc.nextInt();
		 HashMap <String ,Integer> map  =new HashMap<>();
		 String arr []=new String[n];
		 for(int i=0;i<n;i++) {
			 arr[i]=sc.next();
			 if((map.get(arr[i]))==null) map.put(arr[i],1);
			 else map.put(arr[i],map.get(arr[i])+1);
		 }
		 
		 ArrayList <String> ans=new ArrayList<>();
		 
		 int max=0;
		 for(int i=0;i<n;i++) {
			 max=Math.max(max, map.get(arr[i]));		 
		 }
		 
		 for(int i=0;i<n;i++) {
			if(map.get(arr[i])==max) {
				ans.add(arr[i]);
			}
		 }
		 Collections.sort(ans);
		 
		 System.out.println(ans.get(0));
	
	
	}
}
반응형