|
1
2
3
4
|
pythonclass Solution:
def singleNumber(self, nums: List[int]) -> int:
for i in nums:
if nums.count(i)==1: return i
|
cs |
반응형
'python-algorithm' 카테고리의 다른 글
| Hacker rank Simple Array Sum (0) | 2021.10.26 |
|---|---|
| Hacker rank Solve Me First (0) | 2021.10.26 |
| Leetcode 1614. Maximum Nesting Depth of the Parentheses (0) | 2021.08.31 |
| Leetcode 1979. Find Greatest Common Divisor of Array (0) | 2021.08.31 |
| Leetcode 1588. Sum of All Odd Length Subarrays (0) | 2021.08.31 |
댓글