refactor 1338

fishercoder1534 · fishercoder1534 · commit ad91780776e2 · 2020-02-08T09:44:16.000-08:00
diff --git a/README.md b/README.md
@@ -9,8 +9,8 @@ _If you like this project, please leave me a star._ &#9733;
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
 |1343|[Maximum Product of Splitted Binary Tree](https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1343.java) | |Medium||
-|1342|[Reduce Array Size to The Half](https://leetcode.com/problems/reduce-array-size-to-the-half/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1342.java) | |Medium||
 |1341|[The K Weakest Rows in a Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1341.java) | |Easy||
+|1338|[Reduce Array Size to The Half](https://leetcode.com/problems/reduce-array-size-to-the-half/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1338.java) | |Medium||
 |1337|[Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1337.java) | |Easy|String|
 |1333|[Filter Restaurants by Vegan-Friendly, Price and Distance](https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1333.java) | |Medium||
 |1331|[Rank Transform of an Array](https://leetcode.com/problems/rank-transform-of-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1331.java) | |Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1338.java b/src/main/java/com/fishercoder/solutions/_1338.java
@@ -7,7 +7,7 @@
 import java.util.Map;
 
 /**
- * 1342. Reduce Array Size to The Half
+ * 1338. Reduce Array Size to The Half
  *
  * Given an array arr.  You can choose a set of integers and remove all the occurrences of these integers in the array.
  * Return the minimum size of the set so that at least half of the integers of the array are removed.
@@ -41,7 +41,7 @@
  * arr.length is even.
  * 1 <= arr[i] <= 10^5
  * */
-public class _1342 {
+public class _1338 {
     public static class Solution1 {
         public int minSetSize(int[] arr) {
             Map<Integer, Integer> map = new HashMap<>();
diff --git a/src/test/java/com/fishercoder/_1338Test.java b/src/test/java/com/fishercoder/_1338Test.java
@@ -1,18 +1,18 @@
 package com.fishercoder;
 
-import com.fishercoder.solutions._1342;
+import com.fishercoder.solutions._1338;
 import org.junit.BeforeClass;
 import org.junit.Test;
 
 import static org.junit.Assert.assertEquals;
 
-public class _1342Test {
-    private static _1342.Solution1 solution1;
+public class _1338Test {
+    private static _1338.Solution1 solution1;
     private static int[] arr;
 
     @BeforeClass
     public static void setup() {
-        solution1 = new _1342.Solution1();
+        solution1 = new _1338.Solution1();
     }
 
     @Test
