Java算法之只出现一次的数字

136

class Solution {
    public int singleNumber(int[] nums) {
        int item = nums[0];
        int j=1;
        while(j<nums.length){
            item = item^nums[j];
            j++;
        }
        return item;
    }
}