LeetCode--Single Number III
来源:互联网 发布:直通车关键字优化 编辑:程序博客网 时间:2024/06/04 18:04
题目:
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?
vector<int> singleNumber(vector<int>& nums) { unordered_map<int, bool> a; int b = 0; vector<int> c; for(int i = 0; i < nums.size(); ++i) { if(!a.count(nums[i])) { a[nums[i]] = true; } else //删除所有出现两次的数,并统计个数 { a.erase(nums[i]); ++b; } } for(int j = 0; j < nums.size()-2*b; ++j) <span style="font-family: Arial, Helvetica, sans-serif;">//将剩下的数的第一个加入vec,再从map中删除,如同stack的pop</span> { c.push_back(a.begin()->first); a.erase(a.begin()->first); } return c; }
0 0
- [LeetCode] Single Number III
- [leetcode] Single Number III
- [Leetcode]Single Number III
- [leetcode] Single Number III
- Leetcode: Single Number III
- LeetCode || Single Number III
- leetCode---Single Number III
- *LeetCode-Single Number III
- Single Number III -- leetcode
- Leetcode: Single Number III
- [LeetCode] Single Number III
- LeetCode--Single Number III
- leetcode-Single Number III
- LeetCode:Single Number III
- [LeetCode] Single Number III
- LeetCode -- Single Number III
- 【leetcode】Single Number III
- 【Leetcode】Single Number III
- Lua类型判断和转换的简易方法
- 一台电脑同时运行多个tomcat配置方法
- 网络封包分析工具Charles
- Spring MVC之@RequestMapping 详解
- 从零开始机器学习实战1---python安装
- LeetCode--Single Number III
- python matplotlib 安装碰到的问题
- 装饰者模式
- 自定义ViewGroup
- ubuntu12.04 更新源
- JS面向对象的几种创建方式:工厂模式、构造函数模式、原型模式、混合模式、动态原型模式
- GO语言学习:go语言实现android应用的步骤
- Sass入门-基本特性
- kernel mtd 分区与UBOOT 分区的理解