[LeetCode] 448.Find All Numbers Disappeared in an Array

[LeetCode] 448.Find All Numbers Disappeared in an Array

• 题目描述
• 解题思路
• 实验代码

---

题目描述

Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.

Find all the elements of [1, n] inclusive that do not appear in this array.

Could you do it without extra space and in O(n) runtime? You may assume the returned list does not count as extra space.

Example:
Input:
[4,3,2,7,8,2,3,1]

Output:
[5,6]

解题思路

这道题原本不难，只需要找出vector中不存在的元素即可，但题目有运行时间和空间的要求，所以我这里的解决方法是先将数组中的元素进行一个排序，即将每个数换到它对应的位置，因为有些元素出现一次而有些出现了两次，所以这样排序能更容易找到不在对应位置的元素，将它记录下来，这样就能达到题目的要求了。

实验代码

class Solution {
public:
    vector<int> findDisappearedNumbers(vector<int>& nums) {
        vector<int> v;
        int l = nums.size();
        int i = 0;
        while (i < nums.size())
        if (nums[i] != nums[nums[i] - 1]) swap(nums[i], nums[nums[i] - 1]);
        else i++;
        for (int j = 0; j < l; j++)
            if (nums[j] != j+1)
                v.push_back(j+1);
        return v;
    }
};