LeetCode - Single Number
2014-01-13 20:19
344 查看
Single Number
2014.1.13 20:17
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?
Solution:
Exclusive OR is a wonderful operator.
Time complexity is O(n), space complexity is O(1).
Accepted code:
2014.1.13 20:17
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?
Solution:
Exclusive OR is a wonderful operator.
Time complexity is O(n), space complexity is O(1).
Accepted code:
class Solution { public: int singleNumber(int A[], int n) { // Note: The Solution object is instantiated only once and is reused by each test case. int res = 0; for(int i = 0; i < n; ++i){ res ^= A[i]; } return res; } };
相关文章推荐
- LeetCode学习(4)Single Number
- leetcode —— single number
- leetcode:Single Number
- LeetCode - Single number- Jan 31, 2015
- LeetCode之136. Single Number
- [LeetCode 136] Single Number
- 【LeetCode-136】Single Number(C++)
- Single Number 【leetcode】1分钟解题系类
- Single Number(leetcode)
- leetcode[136]Single Number
- [LeetCode] Single Number
- Leetcode刷题记——136. Single Number(单独的数字)
- [Leetcode] 136. Single Number
- Java for LeetCode 136 Single Number
- Single Number---leetcode c# solution
- LeetCode 136. Single Number
- leetcode_136 Single Number-找数组中唯一的单身数
- 【LeetCode刷题记录】Single Number
- leetcode:136. Single Number解题报告
- leetcode[136]:Single Number