LeetCode | Single Number
2014-07-14 19:21
323 查看
原题描述：https://oj.leetcode.com/problems/single-number/
Given an array of integers, every element appears twice except
for one. Find that single one.
解题思路
可以利用异或运算来实现。关于异或运算的几个法则：
a ^ a = 0;
a ^ 0 = a;
a ^ b = b ^ a ;
实现代码
Given an array of integers, every element appears twice except
for one. Find that single one.
解题思路
可以利用异或运算来实现。关于异或运算的几个法则：
a ^ a = 0;
a ^ 0 = a;
a ^ b = b ^ a ;
实现代码
public class Solution {
public int singleNumber(int[] A) {
int result = 0;
for (int i : A) {
result ^= i;
}
return result;
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode-Easy部分标签为HashTable#136 Single Number
- [leetcode代码]Single Number
- leetcode136 Single Number136 Java
- [leetcode] Single Number
- leetcode -- Single Number
- LeetCode之136. Single Number
- [LeetCode136]Single Number寻找一个数组里只出现一次的数
- Leetcode: Single Number
- LeetCode -- Single Number
- [LeetCode136]Single Number
- leetcode--Single Number
- 【leetcode】Single Number
- leetcode笔记：Single Number
- LeetCode 16 Single Number
- LeetCode Single Number
- LeetCode: Single Number
- Leetcode_Alog.136- Single Number
- LeetCode编程练习 - Single Number学习心得
- leetcode: Single Number
- LeetCode 136. Single Number