Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.
Find all the elements that appear twice in this array.
Could you do it without extra space and in O(n) runtime?
求列表中重复的元素有哪些。
将列表排序,若重复,则前后两个数相等。
Example:
Input: [4,3,2,7,8,2,3,1] Output: [2,3]
class Solution:
def findDuplicates(self, nums):
"""
:type nums: List[int]
:rtype: List[int]
"""
ans = []
nums = sorted(nums)
for i in range(len(nums)-1):
if nums[i] == nums[i+1]:
ans.append(nums[i])
return ans
def findDuplicates(self, nums):
"""
:type nums: List[int]
:rtype: List[int]
"""
ans = []
nums = sorted(nums)
for i in range(len(nums)-1):
if nums[i] == nums[i+1]:
ans.append(nums[i])
return ans