[leetcode-645-Set Mismatch]

The set S originally contains numbers from 1 to n. But unfortunately, due to the data error, one of the numbers in the set got duplicated to another number in the set, which results in repetition of one number and loss of another number.

Given an array nums representing the data status of this set after the error. Your task is to firstly find the number occurs twice and then find the number that is missing. Return them in the form of an array.

Example 1:

Input: nums = [1,2,2,4]
Output: [2,3]

Note:

1. The given array size will in the range [2, 10000].
2. The given array‘s numbers won‘t have any order.

思路:

用一个flag标记nums 中的数字是否出现过。如果出现过说明重复了。

最后再扫描一遍flag数组，如果有false标记说明没有出现过。

vector<int> findErrorNums(vector<int>& nums)
    {
        vector<int> ret;
        vector<bool>flag(nums.size()+1,false);

        for (int i = 0; i < nums.size();i++)
        {
             if (flag[nums[i]] == true)ret.push_back(nums[i]);
             flag[nums[i]] = true;
        }
        for (int i = 1; i < flag.size(); i++)
        {
            if (flag[i] == false)ret.push_back(i);
        }
        return ret;
    }