/*
 * @lc app=leetcode.cn id=645 lang=cpp
 *
 * [645] 错误的集合
 */

// @lc code=start
class Solution {
public:
    vector<int> findErrorNums(vector<int>& nums) {
        int n = nums.size();
        int dup = -1;
        for (int i = 0; i < n; ++i) {
            int index = abs(nums[i]) - 1;
            if (nums[index] < 0) {
                dup = abs(nums[i]);
            } else {
                nums[index] *= -1;
            }
        }
        int miss = -1;
        for (int i = 0; i < n; ++i) {
            if (nums[i] > 0) {
                miss = i + 1;
            }
        }
        return {dup, miss};
    }
};
// @lc code=end