【leetcode77】Single Number
2016-07-31 00:15
357 查看
一题目描述:
给定一个数组,只有一个数字出现一次,其余都是两次,判断那个数字思路:
不断取出数据进行异或,最后一个数字,因为相同的数字会抵消代码:
public class Solution { public int singleNumber(int[] nums) { int left = nums[0]; for(int i =1; i< nums.length; i++) { left = left ^ nums[i]; } return left; } }
更多leetcode题目,请看我的leetcode专栏。链接如下:
leetcode专栏我的微信二维码如下,欢迎交流讨论
欢迎关注《IT面试题汇总》微信订阅号。每天推送经典面试题和面试心得技巧,都是干货!
微信订阅号二维码如下:
相关文章推荐
- 【leetcode77】Single Number
- 【leetcode77】Single Number
- 【leetcode77】Single Number
- 【leetcode77】Single Number
- [LeetCode] 136. Single Number
- LeetCode 136. Single Number
- LeetCode - Single Number
- LeetCode-136. Single Number 389. Find the Difference
- Leetcode:Single Number
- 《leetCode》:Single Number
- 77 leetcode - Remove Duplicates from Sorted List II
- leetcode 136. Single Number
- LeetCode 136. Single Number
- LeetCode-77-Combinations dfs+剪枝
- LeetCode编程练习 - Single Number学习心得
- leetcode || 136、Single Number
- Leetcode: Single Number
- leetcode-Single Number
- leetcode 77: Sort Colors
- Single Number(leetcode)