1054 The Dominant Color
思路
用一个值记录当前色号的数量，当收到不同于当前色号的值时则数量减1，当收到相同的色号，数量加1，当数量减为0时，则切换色号
源码
line_number: true1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
| #include <iostream>
#include <stdio.h>
#include <map>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
using namespace std;
int main()
{
int M, N;
cin >> M >> N;
int iDominantColor = 0;
int iDominantColorCount = 0;
int iColor;
for(int i = 0; i < M; i++)
{
for(int j = 0; j < N; j++)
{
cin >> iColor;
if(iDominantColorCount == 0)
{
iDominantColor = iColor;
iDominantColorCount = 1;
}
else
{
if(iDominantColor == iColor)
{
iDominantColorCount++;
}
else
{
iDominantColorCount--;
}
}
}
}
cout<<iDominantColor<<endl;
return 0;
}
|