0645. Set Mismatch

# 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.

## 题目大意 #

• 给定数组的长度范围是 [2, 10000]。
• 给定的数组是无序的。

## 解题思路 #

• 给出一个数组，数组里面装的是 1-n 的数字，由于错误导致有一个数字变成了另外一个数字，要求找出重复的一个数字和正确的数字。这一题是简单题，根据下标比对就可以找到哪个数字重复了，哪个数字缺少了。

## 代码 #

``````
package leetcode

func findErrorNums(nums []int) []int {
m, res := make([]int, len(nums)), make([]int, 2)
for _, n := range nums {
if m[n-1] == 0 {
m[n-1] = 1
} else {
res[0] = n
}
}
for i := range m {
if m[i] == 0 {
res[1] = i + 1
break
}
}
return res
}

``````

Apr 8, 2023