We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 0f66b21 commit ae32cc6Copy full SHA for ae32cc6
python/easy/136. Single Number.py
@@ -1,5 +1,11 @@
1
class Solution:
2
def singleNumber(self, nums: List[int]) -> int:
3
+ """
4
+ singleNumber takes nums List[int] and finds the singular element that is not duplicated and returns it
5
+ nums List[int] (each element appears twice except for 1)
6
+ (1 <= nums.length <= 3 * 104)
7
+ (-3 * 104 <= nums[i] <= 3 * 104)
8
9
ts_set = set()
10
for i in nums:
11
if i in ts_set:
0 commit comments