find your present (2)

最新推荐文章于 2020-07-07 16:53:09 发布

原创最新推荐文章于 2020-07-07 16:53:09 发布 · 441 阅读

0 ·

CC 4.0 BY-SA版权

HDU 专栏收录该内容

10 篇文章

订阅专栏

在一个新年派对上，参与者需要从一堆礼物中找到那个唯一编号出现奇数次的特殊礼物。本篇介绍了解决这一问题的两种高效算法：使用集合进行元素匹配消除及利用位运算中的异或操作。

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

Total Submission(s): 7476 Accepted Submission(s): 1982

Problem Description

In the new year party, everybody will get a "special present".Now it's your turn to get your special present, a lot of presents now putting on the desk, and only one of them will be yours.Each present has a card number on it, and your present's card number will be the one that different from all the others, and you can assume that only one number appear odd times.For example, there are 5 present, and their card numbers are 1, 2, 3, 2, 1.so your present will be the one with the card number of 3, because 3 is the number that different from all the others.

Input

The input file will consist of several cases.
Each case will be presented by an integer n (1<=n<1000000, and n is odd) at first. Following that, n positive integers will be given in a line, all integers will smaller than 2^31. These numbers indicate the card numbers of the presents.n = 0 ends the input.

Output

For each case, output an integer in a line, which is the card number of your present.

Sample Input

Sample Output

3
2

Hint
Hint
 
use scanf to avoid Time Limit Exceeded

Author

8600

Source

HDU 2007-Spring Programming Contest - Warm Up （1）

题意：
给你n个数字，已知只有一个数字出现了奇数次，其他数字都出现了偶数次，要求你找出这个特别的数字。
解题思路：
题目内存限制：1024K，所以不能简单地用数组存然后再处理。
为了节约内存，可以用STL里面的set,map等容器。
当容器里没有这个元素的时候，就插入这个元素，否则，删除这个元素。
最后，容器中肯定只剩下一个元素，便是我们所要的结果。

#include <set>
#include <stdio.h>
using namespace std;
int main()
{
    int n,x;
    set <int> S;
    while(scanf("%d",&n),n)
    {
        while(n--)
        {
            scanf("%d",&x);
            if(S.find(x) == S.end())    //没找到，插入
                S.insert(x);
            else                        //找到了，删除
                S.erase(x);
        }
        printf("%d\n",*S.begin());
        S.clear();
    }
    return 0;
}

其实，这题还有个更好的方法————位异或。
我们先了解一下位异或的运算法则吧：
1、a^b = b^a。
2、(a^b)^c = a^(b^c)。
3、a^b^a = b。
对于一个任意一个数n，它有几个特殊的性质：
1、0^n = n。
2、n^n = 0。
所以可以通过每次异或运算，最后剩下的值就是出现奇数次的那个数字。

#include <stdio.h>

int main()
{
    int n, m, present;
    while (scanf("%d", &n) && n)
    {
        present = 0;
        while (n--)
        {
            scanf("%d", &m);
            present ^= m;
        }
        printf("%d\n", present);
    }
    return 0;
}