Time: 7 ms (82.99%), Space: 18.9 MB (91.53%) - LeetHub

Author: hogan-tech

0645-set-mismatch/0645-set-mismatch.py

@@ -0,0 +1,24 @@
+# time complexity: O(n)
+# space complexity: O(n)
+from typing import List
+
+
+class Solution:
+    def findErrorNums(self, nums: List[int]) -> List[int]:
+        length = len(nums)
+        countArray = [0] * (length + 1)
+        same, miss = 0, 0
+        for num in nums:
+            countArray[num] += 1
+
+        for i in range(1, len(countArray)):
+            if countArray[i] == 2:
+                same = i
+            if countArray[i] == 0:
+                miss = i
+
+        return [same, miss]
+
+
+nums = [1, 1]
+print(Solution().findErrorNums(nums))