[leetcode]136. Single Number@Java解题报告
来源:互联网 发布:教育软件 编辑:程序博客网 时间:2024/06/06 04:02
https://leetcode.com/problems/single-number/description/
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?
思路:用XOR求解
因为A XOR A = 0,且XOR运算是可交换的,于是,对于实例{2,1,4,5,2,4,1}就会有这样的结果:
(2^1^4^5^2^4^1) => ((2^2)^(1^1)^(4^4)^(5)) => (0^0^0^5) => 5
就把只出现了一次的元素(其余元素均出现两次)给找出来了!
package go.jacob.day803;import java.util.Arrays;public class Demo2 {/* * 用异或求解,不需要对数组进行排序 */public int singleNumber(int[] nums) {int res=0;for(int i=0;i<nums.length;i++){//异或res=res^nums[i];}return res;}/* * My solution */public int singleNumber_byme(int[] nums) {Arrays.sort(nums);for(int i=0;i<nums.length;i++){if(i==nums.length-1)return nums.length-1;if(nums[i]!=nums[i+1])return nums[i];}return -1;}}
阅读全文
0 0
- [leetcode]136. Single Number@Java解题报告
- [leetcode] 136. Single Number 解题报告
- LeetCode 136. Single Number 解题报告
- LeetCode 136. Single Number 解题报告
- leetcode:136. Single Number解题报告
- [Leetcode] 136. Single Number 解题报告
- LeetCode 解题报告 Single Number
- LeetCode-Single Number-解题报告
- 【LeetCode】Single Number 解题报告
- LeetCode解题报告 --- Single Number II
- LeetCode — Single Number 解题报告
- LeetCode — Single Number II 解题报告
- LeetCode 136 Single Number解题报告
- LeetCode 137 Single Number II 解题报告
- [leetcode] 260. Single Number III 解题报告
- [leetcode] 137. Single Number II 解题报告
- LeetCode 260. Single Number III 解题报告
- LeetCode 137. Single Number II 解题报告
- thinkPHP5框架基础知识,开发规范与目录结构思维导图
- plsql 注册码
- 磁盘
- iOS应用内跳转到系统设置页面
- linux查看服务器端口状态,打开端口
- [leetcode]136. Single Number@Java解题报告
- 玲珑杯 1149
- keras中卷积核维数与输入维数的关系
- WPF简单教程:Application类的使用
- C++设计模式-Adapter适配器模式
- Hanoi塔问题
- BigDecimal.setScale 处理java小数点
- ResNet及其变体概述
- 人脸识别算法介绍