ZOJ-2132

内存只有1024K，用JAVA估计不行，就用C写了超简陋的map,凑和过。链表内存释放要注意，以后的代码可以参考本题

#include<stdio.h>
#include<stdlib.h>

struct NumberNodeStruct;
typedef struct NumberNodeStruct *NumberNode;

struct NumberNodeStruct
{
    int number;
    int count;
    NumberNode next;
};

int main()
{

    int n;
    while (scanf("%d", &n) != EOF)
    {
        NumberNode *array = malloc(1009 * sizeof(NumberNode));
        int i, num, res;
        for (i = 0; i < 1009; i++)
            array[i] = NULL;
        for (i = 0; i < n; i++)
        {
            scanf("%d", &num);
            if (i == 0)
                res = num;
            int index = num % 1009;
            if (array[index] == NULL)
            {
                array[index] = malloc(sizeof(struct NumberNodeStruct));
                array[index]->number = num;
                array[index]->count = 1;
                array[index]->next = NULL;
            }
            else
            {
                NumberNode curr = array[index];
                int find = 1;
                while (curr->number != num)
                {
                    curr = curr->next;
                    if (curr == NULL)
                    {
                        find = 0;
                        curr = malloc(sizeof(struct NumberNodeStruct));
                        curr->number = num;
                        curr->count = 1;
                        curr->next = NULL;
                    }
                }
                if (find)
                {
                    curr->count++;
                    if (curr->count > n / 2)
                        res = num;
                }
            }
        }
        for (i = 0; i < 1009; i++)
        {
            NumberNode curr = array[i];
            NumberNode temp = NULL;
            while(curr!=NULL)
            {
                temp = curr->next;
                free(curr);
                curr = temp;
            }
        }
        printf("%d\n", res);
        free(array);
    }
    return 0;
}