HDU 1004.Let the Balloon Rise【找出出现次数最多的字符串】
来源:互联网 发布:网络里马鹿是什么意思 编辑:程序博客网 时间:2024/05/16 07:29
Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 98469 Accepted Submission(s): 37708
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
本题题意很清楚,就是【找出出现次数最多的字符串】。
1.首先要注意的是,涉及到字符串的题目,都要加#include<string.h>这个头文件(要加.h哦);
2.把出现的各个颜色用【二维数组】存起来,并且对每个颜色的出现次数都要做一个统计用cnt[1000];
3.第一遍输入时,要先输入第一个颜色,后面每输入一个颜色,都要与之前的i-1个作比较,如果出现相同的,cnt[i]++;
4.最后一步,求出最大的cnt[i],通过遍历加一个if(>)的条件,求出max,同时用position记录出其位置。
5.用scanf、printf输出字符串时用“%s”。
代码如下:
#include <iostream>
#include <stdio.h>#include <string.h>
using namespace std;
int main()
{
char color[1000][16];
int n, i, j, cnt[1000];
int xmax, pos;
while(scanf("%d", &n) != EOF)
{
if(n)
{
cnt[0] = 0;
scanf("%s", color[0]);
for(i=1; i<n; i++)
{
cnt[i] = 0;
scanf("%s", color[i]);
for(j=0; j<i-1; j++)
{
if(strcmp(color[i],color[j])==0)
cnt[i] += 1;
}
}
xmax = 0;
pos = 0;
for(i=1; i<n; i++)
{
if(xmax < cnt[i])
{
xmax = cnt[i];
pos = i;
}
}
printf("%s\n",&color[pos]);
}
}
return 0;
}
0 0
- HDU 1004.Let the Balloon Rise【找出出现次数最多的字符串】
- Let the Balloon Rise 也是字符串出现最大次数。
- hdu 1004.Let the Balloon Rise
- hdu Let the Balloon Rise
- HDU Let the Balloon Rise
- HDU:Let the Balloon Rise
- Hdu Let the Balloon Rise
- Let the Balloon Rise HDU
- hdu Let the Balloon Rise
- HDU--1004 -- Let the Balloon Rise [水] [字符串]
- HDU-#1004 Let the Balloon Rise(字符串+map)
- hdu 1004 Let the Balloon Rise ( 字符串 ,二维数组)
- hdu 1004 Let the Balloon Rise ( 字符串简单处理)
- HDU 1004 Let the Balloon Rise 字符串操作
- hdu 1004 let the balloon rise(字符串水题)
- 1004.Let the Balloon Rise
- 1004.Let the Balloon Rise
- 1004.Let the Balloon Rise
- 白书练习 二叉树的重构
- LEETCODE-- Valid Sudoku
- 每天一点点----项目中關鍵字 “ collectgarbage”
- C++ previous declaration of...with 'C++' linkage
- C++/MFC修行之路(3) MFC中各个类的互相访问/取指针
- HDU 1004.Let the Balloon Rise【找出出现次数最多的字符串】
- js中cookie的使用
- 互联网电视
- spring4+hessian实例^_^
- 不无聊的序列(Non-boring sequences,Bzoj4059,CERC2012)
- SOAP webserivce 和 RESTful webservice 的那些事
- MDK4选项说明
- hdu1005
- C++使用STL:慎重选择删除元素的方法