136. Single Number
来源:互联网 发布:交趾郡 知乎 编辑:程序博客网 时间:2024/06/16 21:07
Given an array of integers, every element appears twice except for one. Find that single one.
class Solution
{
public:
int singleNumber(vector<int>& nums)
{
int len=nums.size();
int result(0);
for(int i=0;i<len;i++)
{
result=result^nums[i];//出现两次则异或结果为零,因此整个数组异或则结果为single one
}
return result;
}
};
阅读全文
0 0
- 136. Single Number&137. Single Number II
- 136. Single Number
- LeetCode 136. Single Number
- 136.Single Number
- [Leetcode] 136. Single Number
- LeetCode 136. Single Number
- 136.Single Number
- 136. Single Number
- 136.Single Number
- 【leetcode】136. Single Number
- 【LeetCode】136. Single Number
- Leetcode 136. Single Number
- leetcode 136. Single Number
- leetcode 136. Single Number
- 136. Single Number LeetCode
- LeetCode 136. Single Number
- LeetCode 136. Single Number
- [LeetCode]136. Single Number
- BZOJ 2748: [HAOI2012]音量调节
- Using Databases with Python
- 津津的储蓄计划
- codevs 1391 伊吹萃香
- 对mutable的认识
- 136. Single Number
- Java 监听器
- python3.4,发送post
- Linux 内核优化-调大TCP最大连接数
- EasyPOI->模版形式导出Excel(多Sheet)
- 【笔记】如何用共享单车数据来做城市规划
- angular管道讲解 及 实例两三枚
- 笔试面试-String的比较
- [codeforces291E]Tree-String Problem(hash+倍增)