1. Description
Given an array containing 1 to n. One number duplicated and one lost. Find the two numbers.
2. Solution
Just do it.
3. Code
vector<int> findErrorNums(vector<int>& nums) {
int n = nums.size();
int dp[n+1];
for(int i=0;i<=n;i++)
dp[i]=0;
vector<int>v;
for(int i=0;i<n;i++){
dp[nums[i]]++;
if(dp[nums[i]]>1)
v.push_back(nums[i]);
}
for(int i=1;i<=n;i++){
if(dp[i]==0)
v.push_back(i);
}
return v;
}