add 645

fishercoder1534 · fishercoder1534 · commit b74f40ed443e · 2017-07-23T13:00:26.000-07:00
diff --git a/README.md b/README.md
@@ -20,6 +20,7 @@ Your ideas/fixes/algorithms are more than welcome!
 
 |  #  |      Title     |   Solutions   | Time          | Space         | Difficulty  | Tag          | Notes
 |-----|----------------|---------------|---------------|---------------|-------------|--------------|-----
+|645|[Set Mismatch](https://leetcode.com/problems/set-mismatch/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_645.java) | O(nlogn) |O(1) | Easy | 
 |644|[Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_644.java) | |O(1) | Hard | Binary Search
 |643|[Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_643.java) | O(n) |O(1) | Easy |
 |642|[Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_642.java) | O(n) |O(n) | Hard | Design
diff --git a/src/main/java/com/fishercoder/solutions/_645.java b/src/main/java/com/fishercoder/solutions/_645.java
@@ -0,0 +1,43 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+/**
+ * 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:
+ The given array size will in the range [2, 10000].
+ The given array's numbers won't have any order.
+ */
+public class _645 {
+    public int[] findErrorNums(int[] nums) {
+        int[] result = new int[2];
+        Arrays.sort(nums);
+        for (int i = 0; i < nums.length-1; i++) {
+            if (nums[i+1] == nums[i]) {
+                result[0] = nums[i];
+            }
+        }
+        long temp = 0;
+        for (int i = 0; i < nums.length; i++) {
+            temp += i+1;
+            temp -= nums[i];
+        }
+        temp += result[0];
+        result[1] = (int) temp;
+        return result;
+    }
+}
diff --git a/src/test/java/com/fishercoder/_645Test.java b/src/test/java/com/fishercoder/_645Test.java
@@ -0,0 +1,26 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._645;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+
+/**
+ * Created by stevesun on 7/23/17.
+ */
+public class _645Test {
+    private static _645 test;
+    private static int[] nums;
+
+    @BeforeClass
+    public static void setup(){
+        test = new _645();
+    }
+
+    @Test
+    public void test1(){
+        nums = new int[]{1,2,2,4};
+        assertArrayEquals(new int[]{2,3}, test.findErrorNums(nums));
+    }
+}
