1054 The Dominant Color (二维数组出现次数最多的数)

Behind the scenes in the computer’s memory, color is always talked about as a series of 24 bits of information for each pixel. In an image, the color with the largest proportional area is called the dominant color. A strictly dominant color takes more than half of the total area. Now given an image of resolution M by N (for example, 800×600), you are supposed to point out the strictly dominant color.

Input Specification:
Each input file contains one test case. For each case, the first line contains 2 positive numbers: M (≤800) and N (≤600) which are the resolutions of the image. Then N lines follow, each contains M digital colors in the range [0,2^24). It is guaranteed that the strictly dominant color exists for each input image. All the numbers in a line are separated by a space.

Output Specification:
For each test case, simply print the dominant color in a line.

Sample Input:

5 3
0 0 255 16777215 24
24 24 0 0 24
24 0 24 24 24

Sample Output:

24

题意：
输入一个n * m数组，输出数组中出现次数大于n * m的一半且最多的数字。

思路：
1.用hash[i] = j 表示 i 出现了 j 次，每输入一个数，hash[num]++，最后输出hash[]中最大的下标就可以了，
缺点是如果输入的数字很大，如10000000，则遍历hash的时候复杂度较高。
2.直接输入矩阵，有且只有一个数出现的次数会大于一半的格子数 该数就是答案
3.定义一个map<int,int> mp，mp[30] = 7，表示30出现了7次，输入一个数字 num 后判断该数是否在mp中，如果在mp中，mp[num]++，否则令mp[num] = 1；

code2

#include <cstdio>
const int maxn = 0xfffffff;
int a[maxn] = {0};
int main()
{
    int n, m, num;
    scanf("%d%d", &n, &m);
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < m; j++)
        {
            scanf("%d", &num);
            a[num]++;
            if(a[num] > n * m / 2)      //解题技巧 有且只有一个数出现次数大于一半的格子数 该数就是答案
            {
                printf("%d", num);
                break;
            }
        }
    }
    return 0;
}

code3

#include <cstdio>
#include <map>
using namespace std;
int main()
{
    int n, m, num;
    scanf("%d%d", &n, &m);
    map<int,int> count;
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < m; j++)
        {
            scanf("%d", &num);
            if(count.find(num) != count.end())
                count[num]++;
            else
                count[num] = 1;
        }
    }
    int k = 0, MAX = 0;
    for(map<int,int>::iterator it = count.begin(); it != count.end(); it++)
    {
        if(it->second > MAX)
        {
            k = it->first;
            MAX = it->second;
        }
    }
    printf("%d", k);
}