【LeetCode】136.Single Number_EASY(十)

136.Single Number

Description:
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?

两个相同的数进行异或运算值为0。

代码：

public class Solution {    public int singleNumber(int[] nums) {        int single=0;        for(int num:nums){            single ^= num;        }        return single;     }}

完成。