杭电oj1004java_杭电ACM（1004） | 学步园

Let the Balloon Rise

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 55430    Accepted Submission(s): 20108

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

Author

WU, Jiazhi

Source

Recommend

JGShining

题意大概是求出现次数最多的字符串。

下面是A过的代码：

#include

#include

using namespace std;

int main()

{

int N,i,j,k,max;

while(1)

{

cin>>N;

if(N==0)break;

char *t=new char [15];

int *n;

max=0;

n=new int [N];

char **q=new char*[N];

for(k=0;k

{

n[k]=0;

q[k]=new char[15];

}

for(i=0;i

{

cin>>t;

for(j=0;j<1002;j++)

{

if(!strcmp(t,q[j]))

{

n[j]++;

break;

}

if(n[j]==0)

{

strcpy(q[j],t);

n[j]=1;

break;

}

}

}

for(j=0;j

if(n[j]>max)

{max=n[j];k=j;}

cout<

delete t;

t=NULL;

delete *q;

q=NULL;

};

}

首先创建一个能容纳所有输入的字符数组和一个数值数组(用来记录个数的)。遍历已保存的字符串数组，发现相同的字符串则对应数值数组+1并跳出循环。遍历完已保存字符串数组还没找到匹配的，则将字符串保存在新的位置并将初始个数赋为1。

所有输入统计完个数之后遍历保存个数的数组，将个数最多的下标取出，通过该下标取出对应的字符串并打印出来！