solve problem Set Mismatch

Author: P-ppc

README.md

@@ -152,6 +152,7 @@ All solutions will be accepted!
 |674|[Longest Continuous Increasing Subsequence](https://leetcode-cn.com/problems/longest-continuous-increasing-subsequence/description/)|[java/py/js](./algorithms/LongestContinuousIncreasingSubsequence)|Easy|
 |234|[Palindrome Linked List](https://leetcode-cn.com/problems/palindrome-linked-list/description/)|[java/py/js](./algorithms/PalindromeLinkedList)|Easy|
 |414|[Third Maximum Number](https://leetcode-cn.com/problems/third-maximum-number/description/)|[java/py/js](./algorithms/ThirdMaximumNumber)|Easy|
+|645|[Set Mismatch](https://leetcode-cn.com/problems/set-mismatch/description/)|[java/py/js](./algorithms/SetMismatch)|Easy|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/SetMismatch/README.md

@@ -0,0 +1,2 @@
+# Set Mismatch
+This problem is easy to solve by hashmap

algorithms/SetMismatch/Solution.java

@@ -0,0 +1,22 @@
+class Solution {
+    public int[] findErrorNums(int[] nums) {
+        int[] res = new int[2];
+        Map<Integer, Boolean> valueMap = new HashMap<Integer, Boolean>();
+        
+        for (int num : nums) {
+            if (valueMap.get(num) == null) {
+                valueMap.put(num, true);
+            } else {
+                res[0] = num;
+            }
+        }
+        
+        for (int i = 1; i <= nums.length; i++) {
+            if (valueMap.get(i) == null) {
+                res[1] = i;
+            }
+        }
+        
+        return res;
+    }
+}

algorithms/SetMismatch/solution.js

@@ -0,0 +1,24 @@
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var findErrorNums = function(nums) {
+    let res = [],
+        valueMap = new Map()
+    
+    nums.forEach(num => {
+        if (valueMap.get(num) === undefined) {
+            valueMap.set(num, true)
+        } else {
+            res.push(num)
+        }
+    })
+    
+    for (let i = 1; i <= nums.length; i++) {
+        if (valueMap.get(i) === undefined) {
+            res.push(i)
+        }
+    }
+    
+    return res
+};

algorithms/SetMismatch/solution.py

@@ -0,0 +1,19 @@
+class Solution(object):
+    def findErrorNums(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: List[int]
+        """
+        res = []
+        value_map = {}
+        
+        for num in nums:
+            if value_map.get(num) == None:
+                value_map[num] = True
+            else:
+                res.append(num)
+                
+        for i in range(1, len(nums) + 1):
+            if value_map.get(i) == None:
+                res.append(i)
+        return res