《算法笔记》4.2 算法初步哈希 C

最新推荐文章于 2021-03-30 18:29:21 发布

辰

最新推荐文章于 2021-03-30 18:29:21 发布

阅读量223

点赞数

分类专栏： codeup

本文链接：https://blog.csdn.net/qq_41972927/article/details/107340987

版权

codeup 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

题目描述

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.

样例输入

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

样例输出

31
None

分析

找出数组中第一个不重复的数

代码

#include <iostream>
#include<algorithm>
using namespace std;
 
int main(int argc, char *argv[]) {
	int N = 0;
	while(cin>>N)
	{
		int arrayM[100100] = {0};
		int arrayN[100100];
		for (int i = 0; i < N; i++)
		{
			cin>>arrayN[i];
			arrayM[arrayN[i]]++;
		}
		int i = 0;
		for (;i < N; i++)
		{
			if (arrayM[arrayN[i]] == 1)
			{
				cout<<arrayN[i]<<endl;
				break;
			}
		}
		if(i == N)
			cout<<"None"<<endl;
	}
	return 0;
}