49msPython


  • 0
    W
    class Solution(object):
        def singleNumber(self, nums):
            nums.sort()
            for i in range(0,len(nums)-1,3):
                if nums[i]!=nums[i+1]:
                    return nums[i]
            return nums[-1]
    

Log in to reply
 

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