136. Single Number
来源:互联网 发布:上海新房成交数据 编辑:程序博客网 时间:2024/06/05 20:24
Given an array of integers, every element appears twice except for one. Find that single one.
要求:线性时间,常量空间
异或:2个相同数异或为0,0与任意数异或还是等于原来的数。
public int singleNumber(int[] nums) { int result=0; for(int i=0;i<nums.length;i++) result=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
- 分布式一致性算法Raft详解
- MySQL字符串函数substring:字符串截取
- 希尔排序
- Spring 各个包的作用
- oracle常用连接 left join vs right join vs inner join
- 136. Single Number
- Partition List
- 2016.09.06回顾
- 基于面向协议MVP模式下的软件设计-(iOS篇)
- 位运算
- 生活与工作
- centos7 mysql数据库安装和配置
- unity物品图鉴(xml数据加载)
- 100天土鸡饲养计划(43)