LeetCode之136. Single Number

--------------------------------------

一个数异或它自己会得到0,0异或n会得到n,所以可以用异或来消除重复项

AC代码如下:

public class Solution {
    public int singleNumber(int[] nums) {
        int res=0;
        for(Integer i:nums) res^=i;
        return res;
    }
}

题目来源: https://leetcode.com/problems/single-number/

原文地址:https://www.cnblogs.com/cc11001100/p/5991630.html