首页 > itarticle > 136. single number

136. single number

admin 1月 30, 2021 0

Description

Difficulty: Easy

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?

给出一个整数数组，有一个元素只出现了一次，其他所有元素都出现了两次。找出这个元素。

Solution

class (object):
    def singleNumber(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        rslt = {}
        for i in nums:
            try:
                rslt[i] += 1
            except KeyError:
                rslt[i] = 1
        for j in rslt:
            if rslt[j] == 1:
                return j