HDU1004 Let the Balloon Rise

 题意：多组数据，每组给一个n和n行颜色单词，统计每组最受欢迎的颜色，当n=0时结束

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main{
     public static void main(String[] args) {
         Scanner in = new Scanner(System.in);
         int n = 0;
         while (in.hasNext()) {
             n = in.nextInt();
             if (n == 0) {
                 break;
             }
             String[] color = new String[n];
             int[] cnt = new int[n];
             for (int i = 0; i < n; ++i) {
                 color[i] = in.next();
             }
             for (int i = 0; i < n - 1; ++i) {
                 for (int j = i + 1; j < n; ++j) {
                     if (color[i].equals(color[j])) {
                         ++cnt[i];
                     }
                 }
             }
             int idx = 0;
             int maxx = 0;
             for (int i = 0; i < n; ++i) {
                 if (cnt[i] > maxx) {
                     maxx = cnt[i];
                     idx = i;
                 }
             }
             System.out.println(color[idx]);
         }
     }
}