LeetCode442：Find All Duplicates in an Array

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]

---

LeetCode：链接

这道题是找到所有重复的数字，而剑指Offer_编程题50：数组中重复的数字是找到一个重复的数字就行，所以做法不同。如果用剑指offer的做法，就会找到重复的数字......

交换变量是有顺序的，必须得按照规定的顺序交换变量才可以，因为如果先交换nums[i]就会修改，之后还会用到nums[i]。

class Solution(object):
    def findDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: List[int]
        """
        for i in range(len(nums)):
            while nums[i] != nums[nums[i]-1]:
                nums[nums[i]-1], nums[i] = nums[i], nums[nums[i]-1]
        res = []
        for i in range(len(nums)):
            if i+1 != nums[i]:
                res.append(nums[i])
        return res