leetcode 442(高级编程技术 week9-1)

leetcode 442(高级编程技术 week9-1)

原题可见：https://leetcode.com/problems/find-all-duplicates-in-an-array/description/

题目

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]

题目分析

仔细看题，会发现一个很明显的提示：

$$1 <= a[i] <= n$$

看到这个，基本就可以确定使用类似于桶排序的方式记录每一个元素的个数，又考虑到题目给的数组中的数字最多也只会出现两次，所以就设置为如果只要某一个桶大于1，就将该桶对应的数字放进答案中。

代码展示

class Solution:
    def findDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: List[int]
        """
        ans = []
        tong = [0 for _ in range(len(nums))]
        for i in range(0,len(nums)):
            tong[nums[i]-1] += 1
            if tong[nums[i]-1] > 1:
                ans.append(nums[i])
        return ans