-
Notifications
You must be signed in to change notification settings - Fork 2
/
q0442.py
33 lines (29 loc) · 931 Bytes
/
q0442.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
#!/usr/bin/python3
from typing import List
class Solution:
def findDuplicates(self, nums: List[int]) -> List[int]:
result = list()
for i in range(len(nums)):
index = abs(nums[i]) - 1
if nums[index] < 0:
result.append(index + 1)
nums[index] = -nums[index]
return result
def findDuplicates2(self, nums: List[int]) -> List[int]:
result = list()
i = 0
while i < len(nums):
number = nums[i]
if number == i + 1:
i = i
elif nums[number - 1] == number:
result.append(number)
elif number > i + 1:
nums[i] = nums[number - 1]
nums[number - 1] = number
i -= 1
else:
nums[i] = nums[number - 1]
nums[number - 1] = number
i += 1
return result