【LeetCode】 260. Single Number III
来源:互联网 发布:他知道我们在膜他知乎 编辑:程序博客网 时间:2024/06/06 05:55
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?
public class Solution { public int[] singleNumber(int[] nums) { int sum = 0; for (int i : nums) { sum ^= i; } sum &= -sum; int[] res = new int[2]; for (int i : nums) { if ((i & sum) == 0) { res[0] ^= i; } else { res[1] ^= i; } } return res; }}
0 0
- [leetcode] 260.Single Number III
- Leetcode 260. Single Number III
- 260. Single Number III LeetCode
- [LeetCode]260. Single Number III
- LeetCode 260. Single Number III
- LeetCode 260. Single Number III
- LeetCode 260. Single Number III
- LeetCode *** 260. Single Number III
- leetcode-260. Single Number III
- 【leetcode】 260. Single Number III
- leetcode 260.Single Number III
- leetcode 260. Single Number III
- 【LeetCode】260. Single Number III
- Leetcode 260. Single Number III
- LeetCode - 260. Single Number III
- 【leetcode】260. Single Number III
- leetcode 260. Single Number III
- LeetCode 260. Single Number III
- ECMAScript 6(3)const和顶层对象
- 网络程序设计
- Arcgis 三维场景模拟
- VirtualBox Ubuntu hadoop-1.2.1 搭建总结
- 网络程序设计考察报告
- 【LeetCode】 260. Single Number III
- android的Socket通信
- 微服务之分布式跟踪系统(springboot+zipkin)
- Ajax_典型应用_2级联动__城市到部门的 Ajax 实现
- 基于Spring Boot和Spring Cloud实现微服务架构学习
- php简单实现socket通信
- js删除对象的属性
- Microsoft Operations Management Suite 启用NPM网络性能监视
- 一款开源免费的.NET文档操作组件——DocX