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]

数组中为1-n的数字，现在用其中一个数字覆盖掉另一个数字，求出现2次的数字和丢失的那个

C++（32ms）：

 1 class Solution {
 2 public:
 3     vector<int> findErrorNums(vector<int>& nums) {
 4         vector<int> map(10010,0) ;
 5         vector<int> res(2,0) ;
 6         for(int i  = 0; i < nums.size() ; i++){
 7             res[1] ^= (i+1)^nums[i] ;
 8             if (++map[nums[i]] == 2){
 9                 res[0] = nums[i] ;
10             }
11         }
12         res[1] ^= res[0] ;
13         return res ;
14     }
15 };

java(10ms):

 1 class Solution {
 2     public int[] findErrorNums(int[] nums) {
 3         int n = nums.length ;
 4         int[] map = new int[n+1] ;
 5         int[] res = {0,0} ;
 6         for(int i  = 0; i < nums.length ; i++){
 7             res[1] ^= (i+1)^nums[i] ;
 8             if (++map[nums[i]] == 2){
 9                 res[0] = nums[i] ;
10             }
11         }
12         res[1] ^= res[0] ;
13         return res ;
14     }
15 }