leetcode No.136 只出现一次的数字

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

猜你喜欢

转载自blog.csdn.net/qq_33399567/article/details/88992812