leet code upload

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

    }
}