codeup————6112（Be unique）(哈希)

问题 C: Be Unique (20)

[命题人 : 外部导入]

时间限制 : 1.000 sec  内存限制 : 32 MB

解决: 908提交: 2010统计

题目描述

Being unique is so important to people on Mars that even their lottery is designed in a unique way. The rule of winning is simple: one bets on a number chosen from [1, 104]. The first one who bets on a unique number wins. For example, if there are 7 people betting on 5 31 5 88 67 88 17, then the second one who bets on 31 wins.

输入

Each input file contains one test case. Each case contains a line which begins with a positive integer N (<=105) and then followed by N bets. The numbers are separated by a space.

输出

For each test case, print the winning number in a line. If there is no winner, print "None" instead.

样例输入 Copy

7 5 31 5 88 67 88 17
5 888 666 666 888 888

样例输出 Copy

31
None

 

#include<iostream>
using namespace std;

int main(){
	int N;
	while(cin>>N){
		int n[100001]={0},loca[100001]={0},values[100001]={0},nums[100001]={0};
		for(int i=0;i<N;i++){
			cin>>n[i];
			int temp=n[i]%100001;
			if(values[temp]!=0){
				if(values[temp]!=n[i]){
					while(values[temp]!=0){
						if(values[temp]==n[i]){
							break;
						}
						if(temp==100000){
							temp=0;
						}
						else {
							temp++;
						}
					}
				}
			}
			values[temp]=n[i];
			nums[temp]++;
			loca[i]=temp;
		}
		for(int i=0;i<N;i++){
			if(nums[loca[i]]==1){
				cout<<n[i]<<endl;
				break;
			}
			if(i==N-1){
				cout<<"None"<<endl;
			}
		}
	}
	return 0;
} 

今日份总结：哈希——线性探查法