LeetCode 645. Set Mismatch

1.问题描述

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]

2. 算法分析

利用数组元素与下标之间的关系，访问过元素后置为它的相反数，如果访问到元素为负数，说明重复了，第一次遍历结束后，开始第二次遍历，若数组中存在正数，则对应的下标＋1即为缺失的。

3.代码实现

class Solution {
public:
    vector<int> findErrorNums(vector<int>& nums) {
        vector<int> res(2,-1);
        
        for(int i = 0; i < nums.size(); ++i){
            int idx = abs(nums[i]) - 1;
            if(nums[idx] < 0) 
                res[0] = abs(nums[i]);  
            else      
                nums[idx] = -nums[idx];
        }
        
        for(int i = 0; i < nums.size(); ++i){
            if(nums[i] > 0)
                res[1] = i + 1;
        }
        
        return res;
        
    }
};