HDU-1004Let the Balloon Rise
来源:互联网 发布:app软件开发流程 编辑:程序博客网 时间:2024/06/05 18:39
Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 118510 Accepted Submission(s): 46446
Problem Description
Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest is over, they will count the balloons of each color and find the result.
This year, they decide to leave this lovely job to you.
This year, they decide to leave this lovely job to you.
Input
Input contains multiple test cases. Each test case starts with a number N (0 < N <= 1000) -- the total number of balloons distributed. The next N lines contain one color each. The color of a balloon is a string of up to 15 lower-case letters.
A test case with N = 0 terminates the input and this test case is not to be processed.
A test case with N = 0 terminates the input and this test case is not to be processed.
Output
For each case, print the color of balloon for the most popular problem on a single line. It is guaranteed that there is a unique solution for each test case.
Sample Input
5greenredblueredred3pinkorangepink0
Sample Output
redpink
解题思路:将每次输入的第一个颜色单独去出来 作为比较的对象,然后另设一个存储数组,用来保存出现的次数。
解题代码:
package First;import java.util.Scanner;public class Problem1004 {public static void main(String[] args) {Scanner sc = new Scanner(System.in); while(sc.hasNext()){ int n = sc.nextInt(); if(n==0){ System.exit(0);//关闭当前进程。 } String[] str = new String[1000]; int[] number = new int[1000]; number[0]=0; str[0]=sc.next(); for(int i=1;i<n;i++){ str[i] = sc.next(); number[i]=0; for(int j=0;j<i-1;j++){ if(str[i].equals(str[j])){ number[i]++; } } } int max=number[0],a=0; for(int i=1;i<n;i++){ if(number[i]>max){ max=number[i]; a=i; } } System.out.println(str[a]); }}}
0 0
- HDU 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise
- hdu 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise
- HDU--1004 Let the Balloon Rise
- hdu 1004 Let the Balloon Rise
- hdu 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise
- hdu 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise
- Hdu 1004 - Let the Balloon Rise
- HDU 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise
- HDU--1004--Let the Balloon Rise
- hdu 1004 Let the Balloon Rise
- hdu 1004 Let the Balloon Rise
- HDU 1004 Let the Balloon Rise STL
- CoordinatorLayout显示隐藏ToolBar
- Mysql笔记
- java基础知识,一些概念的区别总结
- 内存管理-SLAB(SLAB的基本数据结构)
- C++中的new、operator new与placement new
- HDU-1004Let the Balloon Rise
- Buy or Build UVA
- 【JavaEE】第一个JSP程序--了解JSP执行过程
- 汇编语言中OUT和IN的用法
- Oracle执行优化hint使用教程
- uml类图基本知识
- select,poll.epoll区别
- ZOJ 3955 Saddle Point (树状数组)
- 安装软件出现缺少vcruntime140dll的解决方法