It has been 1154 days since the last update, the content of the article may be outdated.

此篇文章為我的解題紀錄，程式碼或許並不是很完善

Leetcode - 136. Single Number

解題思路

這題我用了最笨的方法 就是跑迴圈來一個一個字元數他出現過幾次拉😂

我滴程式碼

python
1
2
3
4
5
6
7
8
class Solution:
    def singleNumber(self, nums: List[int]) -> int:
        if len(nums) == 1:
            return nums[0]
        else:
            for n in nums:
                if nums.count(n) == 1:
                    return n