<gh_stars>0
# Problem: Single Number
#
# Given an array of integers, every element appears twice except for one. Find that single one.
#
# Note:
#
# Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
#
################################################################################

class Solution(object):
    def singleNumber(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        result = 0
        for num in nums:
            result = result ^ num

        return result

# Problem: Single Number
#
# Given an array of integers, every element appears twice except for one. Find that single one.
#
# Note:
#
# Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
#
################################################################################

class Solution(object):
    def singleNumber(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        result = 0
        for num in nums:
            result = result ^ num

        return result
# Problem: Single Number # # Given an array of integers, every element appears twice except for one. Find that single one. # # Note: # # Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory? # ################################################################################ :type nums: List[int]         :rtype: int