1041. Be Unique (20)
2015-07-10 14:19
218 查看
题目如下:
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.
Input Specification:
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.
Output Specification:
For each test case, print the winning number in a line. If there is no winner, print "None" instead.
Sample Input 1:
Sample Output 1:
Sample Input 2:
Sample Output 2:
题目要求找出一个序列中第一个在序列中只出现了一次的数,实现方法很简单,使用map记录每个数出现的次数,然后使用vector记录输入顺序,依次判断即可。
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.
Input Specification:
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.
Output Specification:
For each test case, print the winning number in a line. If there is no winner, print "None" instead.
Sample Input 1:
7 5 31 5 88 67 88 17
Sample Output 1:
31
Sample Input 2:
5 888 666 666 888 888
Sample Output 2:
None
题目要求找出一个序列中第一个在序列中只出现了一次的数,实现方法很简单,使用map记录每个数出现的次数,然后使用vector记录输入顺序,依次判断即可。
#include <iostream> #include <map> #include <vector> #include <stdio.h> using namespace std; int main() { map<int,int> numMap; vector<int> nums; int N; cin >> N; int num; for(int i = 0; i < N; i++){ scanf("%d",&num); numMap[num]++; nums.push_back(num); } num = - 1; for(int i = 0; i < nums.size(); i++){ if(numMap[nums[i]] == 1){ num = nums[i]; break; } } if(num == -1) cout << "None" << endl; else cout << num << endl; return 0; }
相关文章推荐
- LintCode UniquePaths 不同的路径
- xcodebuild脚本打包
- 关于UIButton的 setBackgroundImage 和 setImage区别
- UITableView 的常识
- UILabel
- Build与Version
- Build与Version
- ios UIPageViewController+pageControl实现引导页
- IOS-UIViewController的生命周期
- iOS 使用手势UIGestureRecognizer对图像进行缩放、移动、旋转操作
- 语音识别之梅尔频谱倒数MFCC(Mel Frequency Cepstrum Coefficient)
- Ueditor图片上传设置(1.4.3 JSP版本)
- c#设计模式---建造者模式(Builder Pattern)
- [UGUI] Rect Transform
- StringBuilder用法
- mysql select column default value if is null
- Quick-Coco2d-x 打包 Android 与 环境搭建
- 关于UIView的Layer,IOS提供了三个方法
- checkbox未选中状态不传递value的解决办法
- UIAlertView和UIActionSheet