260. Single Number III
来源:互联网 发布:mmd千本樱镜头数据 编辑:程序博客网 时间:2024/03/28 18:51
Given an array of numbers nums
, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.
For example:
Given nums = [1, 2, 1, 3, 2, 5]
, return [3, 5]
.
Note:
- The order of the result is not important. So in the above example,
[5, 3]
is also correct. - Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity?
Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.
Subscribe to see which companies asked this question
class Solution {public: vector<int> singleNumber(vector<int>& nums) { vector<int> v1; map<int,int> m1; for(int i=0;i<nums.size();++i) { m1[nums[i]]++; } for(auto p:m1) { if(p.second==1) v1.push_back(p.first); } return v1; }};
0 0
- 260.Single Number III
- 260. Single Number III
- 260. Single Number III
- 260. Single Number III
- 260. Single Number III
- 260. Single Number III
- 260. Single Number III
- 260. Single Number III
- 260. Single Number III
- 260. Single Number III
- 260. Single Number III
- 260. Single Number III
- 260. Single Number III
- 260. Single Number III
- 260. Single Number III
- 260. Single Number III
- 260. Single Number III
- 260. Single Number III
- UVA 12299 RMQ with Shifts 线段树
- Repair the Wall(贪心 区间覆盖)
- notepad颜色相关修改
- 【BS学习】——B/S结构
- 注解的应用
- 260. Single Number III
- Android之使用TCP和URL协议进行网络编程
- JsonKit的基本使用
- Native与H5交互的那些事
- 用Ghost搭建自己的博客
- 把数组排成最小的数
- PHP array_diff 的应用
- 一起学BAT脚本(batch script)--01
- hdu 4774 Stealing Harry Potter's Precious 状态压缩+bfs 解题报告