136. 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?

链接： http://leetcode.com/problems/single-number/

2/18/2017, Java

public class Solution {
    public int singleNumber(int[] nums) {
        int value = 0;
        for(int i = 0; i < nums.length; i++) {
            value ^= nums[i];
        }
        return value;
    }
}