[LeetCode]Single Number
2014-09-29 22:46
337 查看
题目描述:
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?
解题方案:
该题利用异或可以方便求解,下面本题是代码:
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 = A[0]; for(int i = 1; i < n; ++i){ //利用异或 result = result ^ A[i]; } return result; } };
相关文章推荐
- [LeetCode] Single Number, Solution
- [LeetCode]Single Number
- leetcode-Single Number
- [LeetCode] Single Number
- leetcode —— single number
- leetcode-136-Single Number
- [LeetCode] Single Number
- leetcode 136. Single Number
- Single Number 【leetcode】1分钟解题系类
- 10--LeetCode【Single Number】|C语言|
- Leetcode:136. Single Number
- [leetcode-136]Single Number(c)
- 【Leetcode-easy-136】Single Number
- [Leetcode]Single Number
- leetcode|Single Number(136)
- The Solution to Leetcode 136 Single Number
- [Leetcode]Single Number
- LeetCode:Single Number
- Java [Leetcode 136]Single Number
- LeetCode 136 Single Number 出现一次的数字