[LeetCode]Single Number
2013-10-09 17:11
330 查看
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?
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
public class Solution { public int singleNumber(int[] A) { // Note: The Solution object is instantiated only once and is reused by each test case. int result = 0; if(A.length == 0) return 0; for(int i = 0;i<A.length;i++){ result ^= A[i]; } return result; } }
相关文章推荐
- leetcode136 Single Number136 Java
- LeetCode 136:Single Number
- LeetCode 136. Single Number
- leetcode_single number
- 【LeetCode】Single Number
- leetcode题目:Single Number和Single Number II
- LeetCode 136: Single Number
- [Leetcode]Single Number
- LeetCode--Single Number
- Leetcode 136. Single Number
- LeetCode 136 Single Number(仅仅出现一次的数字)
- leetcode(136)_Single Number
- <LeetCode OJ>Single Number( I / II / III )【136 / 137 / 260】
- LeetCode - Single Number
- 【LeetCode with Python】 Single Number
- 【leetcode77】Single Number
- [ LeetCode] Single Number [3]
- LeetCode-Single Number
- [Leetcode]Single Number
- LeetCode 136. Single Number