feat: update golang solution to lc problem: No. 0645.Set Mismatch

maolonglong · maolonglong · commit 545ee4e1abd2 · 2021-07-04T03:23:48.000Z
diff --git a/solution/0600-0699/0645.Set Mismatch/README.md b/solution/0600-0699/0645.Set Mismatch/README.md
@@ -127,6 +127,27 @@ class Solution {
 }
 ```
 
+### **Go**
+
+把每个数都放到它应该在的位置，最后出现“异常”的就是重复的数和丢失的数。
+
+```go
+func findErrorNums(nums []int) []int {
+	n := len(nums)
+	for i := 0; i < n; i++ {
+		for nums[i] != i+1 && nums[nums[i]-1] != nums[i] {
+			nums[i], nums[nums[i]-1] = nums[nums[i]-1], nums[i]
+		}
+	}
+	for i := 0; i < n; i++ {
+		if nums[i] != i+1 {
+			return []int{nums[i], i + 1}
+		}
+	}
+	return []int{-1, -1}
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/0600-0699/0645.Set Mismatch/README_EN.md b/solution/0600-0699/0645.Set Mismatch/README_EN.md
@@ -104,6 +104,25 @@ class Solution {
 }
 ```
 
+### **Go**
+
+```go
+func findErrorNums(nums []int) []int {
+	n := len(nums)
+	for i := 0; i < n; i++ {
+		for nums[i] != i+1 && nums[nums[i]-1] != nums[i] {
+			nums[i], nums[nums[i]-1] = nums[nums[i]-1], nums[i]
+		}
+	}
+	for i := 0; i < n; i++ {
+		if nums[i] != i+1 {
+			return []int{nums[i], i + 1}
+		}
+	}
+	return []int{-1, -1}
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/0600-0699/0645.Set Mismatch/Solution.go b/solution/0600-0699/0645.Set Mismatch/Solution.go
@@ -0,0 +1,14 @@
+func findErrorNums(nums []int) []int {
+	n := len(nums)
+	for i := 0; i < n; i++ {
+		for nums[i] != i+1 && nums[nums[i]-1] != nums[i] {
+			nums[i], nums[nums[i]-1] = nums[nums[i]-1], nums[i]
+		}
+	}
+	for i := 0; i < n; i++ {
+		if nums[i] != i+1 {
+			return []int{nums[i], i + 1}
+		}
+	}
+	return []int{-1, -1}
+}
