leetcode--Single Number

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?

[java] view plain copy

1. public class Solution {  
2.     public int singleNumber(int[] nums) {  
3.         int res = 0;  
4.         for(int i=0;i<nums.length;i++){  
5.             res ^= nums[i];  
6.         }  
7.         return res;  
8.     }  
9. }

原文链接http://blog.csdn.net/crazy__chen/article/details/46561349