杭电oj 1004解答问题

Question

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.

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.

Sample Input
5
green
red
blue
red
red
3
pink
orange
pink
0

Sample Output
red
pink

public static void main(String args[]) {
        Scanner input = new Scanner(System.in);
        while (input.hasNext()) {
            String[] array = new String[105];/*记颜色*/
            int[] str=new int[105];/*数量*/
            int count = input.nextInt();
            if(count==0)break;
            int b=0;
            for (int num=0; num<count; num++) {
                String word= input.next();
                int judge=0;
                if (num==0){
                    array[b]=word;
                    str[b++] += 1;
                    judge=1;
                }
                for(int a=0;a<num;a++){
                    if(word.equals(array[a])){
                        str[a] += 1;
                        judge=1;
                        break;
                    }
                }
                if (judge==0){
                    array[b]=word;
                    str[b++] += 1;
                }
            }
            int max=0;
            for (int num=1;num<b;num++){
                if (str[num]>str[max]) max=num;
            }
            System.out.println(array[max]);
        }
    }

大家可以帮我看看吗？带入示例是对的，自己试了几组数据也是对的但提交时WA。

Answer 1

给你另一种思路吧，利用hashmap，颜色为key，数量为value，每一组统计完成后遍历key得到最大的value