3 line java solution with XOR O(n) time


  • 0
    C
    public int singleNumber(int[] nums) {
            int result = 0;
            for(int i=0;i<nums.length;i++) result ^= nums[i];
            return result;
        }
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.