136. Single Number
来源:互联网 发布:手机看pdf软件 编辑:程序博客网 时间:2024/06/04 19:05
题目:
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?
代码:
class Solution {public: int singleNumber(vector<int>& nums) { int result = 0; for(int i = 0;i<nums.size();i++) result^=nums[i]; 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
- React Native加载图片详解
- mysql5.7.18修改或者设置密码
- CSU-ACM2017暑假集训2-二分搜索 poj-32732 Monthly Expense
- 【主流身份管理技术辨析】Authentication and Authorization: OpenID vs OAuth2 vs SAML
- Data Binding学习(二)
- 136. Single Number
- tarjan二分图匹配问题
- ios-关于cell的模板
- python 的 Pillow实现图片对比
- 简易手动部署多节点的Openstack(L版)——陆(安装Dashboard服务)
- JS/HTML格式化显示
- JavaScript运算
- 用面向对象继承的思想设定游戏中怪物的属性和方法
- 【Java集合源码剖析】Java集合框架