LeetCode 136:Single Number
来源:互联网 发布:淘宝网创立时间 编辑:程序博客网 时间:2024/06/07 00:55
Given an array of integers, every element appears twice except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
注意:
你的算法时间复杂度应该是线性的。你能不用额外的内存空间来实现它吗?
其实也是突发奇想。。。利用了相同数字异或为0的性质,把数组里面所有数字都异或一遍就好。。。感觉考的还是数学知识
class Solution {public: int singleNumber(vector<int>& nums) { int ans=0; for(int i=0;i<nums.size();i++) ans^=nums[i]; return ans; }};
0 0
- LeetCode(136)Single Number
- LeetCode 136 Single Number
- LeetCode 136 Single Number
- LeetCode: Single Number [136]
- [leetcode 136] Single Number
- [leetcode]136 Single Number
- leetcode-136 Single Number
- LeetCode 136 Single Number
- LeetCode 136 Single Number
- leetcode || 136、Single Number
- LeetCode 136 : Single Number
- leetcode Single Number 136
- LeetCode---(136) Single Number
- leetcode#136 Single Number
- Leetcode[136]-Single Number
- leetcode-136-Single Number
- Leetcode 136 Single Number
- leetcode[136]:Single Number
- Spark动态资源分配-Dynamic Resource Allocation
- PHP SESSION - Redis
- 在海思hisiv100nptl平台上交叉编译并安装SRS
- Service基础之调用系统电话管理器
- 数据结构实现之栈
- LeetCode 136:Single Number
- iOS-Core Foundation框架到Foundation桥接的三种方式
- BootStrap入门教程 (四)
- 决策树
- 一步一步在Windows下用MinGW编译x264(x264-snapshot-20160119-2245)
- 数据结构实现之队列
- Codeforce 445E
- Android 回调机制
- jq与dom对象相互转换