[LeetCode] Single Number
2014-05-22 08:40
309 查看
题目:
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?
解答:
没什么可多说的,用到的知识点就是:a异或a = 0,a异或0 = a,异或满足交换律
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?
解答:
class Solution { public: int singleNumber(int A[], int n) { int result = 0; for(int i = 0; i < n; i++) { result = result ^ A[i]; } return result; } };
没什么可多说的,用到的知识点就是:a异或a = 0,a异或0 = a,异或满足交换律
相关文章推荐
- LeetCode:Single Number
- 位运算——LeetCode 136.Single Number
- Leetcode--Single Number
- 【leetcode】 Single Number
- LeetCode之136. Single Number
- [LeetCode 136] Single Number
- 【LeetCode-136】Single Number(C++)
- LeetCode-Single Number
- [LeetCode] 136. Single Number
- LeetCode[136] Single Number 位运算异或,HashMap(Java)
- [LeetCode] Single Number
- LeetCode-136. Single Number 389. Find the Difference
- leetcode#136 Single Number
- 【LeetCode】记与Single Number相关
- Leetcode -- Single Number
- LeetCode:Single Number(2)
- [leetcode 136] Single Number
- LeetCode 136. Single Number
- 【LeetCode】Single Number
- [LeetCode] Single Number