| 网站首页 | 业界新闻 | 群组 | 交易 | 人才 | 下载频道 | 博客 | 代码贴 | 编程论坛
大量收QQ微信精准粉/交友粉,非诚勿扰千里之行 始于足下
共有 458 人关注过本帖
标题:杭电ACM1004 java 不知道问题在那 求大神解惑
只看楼主 加入收藏
绝世强强
Rank: 1
等 级:新手上路
帖 子:1
专家分:0
注 册:2017-2-7
结帖率:100%
  已结贴   问题点数:20  回复次数:1   
杭电ACM1004 java 不知道问题在那 求大神解惑
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.
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.
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.



import java.util.Scanner;

public class Main{
    public static void main(String[] agrs){
        Scanner in = new Scanner(System.in);
        while(in.hasNext()){
            int  n = in.nextInt();
            if(n==0){
                break;
            }
            String [] a = new String[1001];
            for (int i = 0; i < n; i++) {
                a[i] = in.next();
               
            }
            String x =null;
            int num = 0,max=0,pop=0;
            for (int i = 0; i < n; i++) {
                x = a[i];
                for (int j = 0; j < n; j++) {
                    if(x==a[j]){
                        num++;
                        
                    }
                }
               
                if(num>max){
                    max=num;
                    num = 0;
                    pop = i;
                }
            }
            System.out.println(a[pop]);
            
        }
    }
}
搜索更多相关主题的帖子: multiple  contain  popular  problem  secret  
2017-02-07 12:33
husiwen
Rank: 9Rank: 9Rank: 9
等 级:蜘蛛侠
威 望:2
帖 子:226
专家分:1125
注 册:2010-5-23
  得分:20 
第一层循环的时候 num每次要清0
2017-02-07 17:29







关于我们 | 广告合作 | 编程中国 | 清除Cookies | TOP | 手机版

编程中国 版权所有,并保留所有权利。
Powered by Discuz, Processed in 0.084021 second(s), 9 queries.
Copyright©2004-2018, BCCN.NET, All Rights Reserved