LeetCode-Easy刷题(31) Single Number
2017-11-30 19:22
423 查看
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?
给定一个数组中除了其中一个元素外其余的都出现两次,找出它.
要求线性复杂,不使用额外空间.
//位运算 亦或
public int singleNumber(int[] nums) {
int result = nums[0];
for (int i = 1; i < nums.length; i++) {
result = result^nums[i];
}
return result;
}
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
给定一个数组中除了其中一个元素外其余的都出现两次,找出它.
要求线性复杂,不使用额外空间.
//位运算 亦或
public int singleNumber(int[] nums) {
int result = nums[0];
for (int i = 1; i < nums.length; i++) {
result = result^nums[i];
}
return result;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode - Single number- Jan 31, 2015
- LeetCode:Single Number
- LeetCode：Single Number
- [LeetCode]136. Single Number
- [Leetcode] Single Number
- leetcode 136. Single Number
- [Leetcode]Single Number
- Leetcode 31. Next Permutation
- LeetCode学习（4）Single Number
- Leetcode 之Regular Expression Matching（31）
- leetcode题解-31. Next Permutation
- [leetcode]31. Next Permutation -Find next greater number with same set of digits
- [LeetCode] Subsets [31]
- [leetcode] Single Number
- leetcode做题总结，题目Next Permutation 31
- 【LeetCode】Single Number
- 【LeetCode】31.Next Permutation(Medium)解题报告
- leetcode-31 Next Permutation 数字排列组合找到下一个更大值
- LeetCode 31. Next Permutation
- LeetCode--136. Single Number