refactor 1300

Author: fishercoder1534

README.md

@@ -392,7 +392,7 @@ _If you like this project, please leave me a star._ ★
 |1305|[All Elements in Two Binary Search Trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1305.java) | |Medium||
 |1304|[Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1304.java) | |Easy||
 |1302|[Deepest Leaves Sum](https://leetcode.com/problems/deepest-leaves-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1302.java) | |Medium||
-|1300|[Sum of Mutated Array Closest to Target](https://leetcode.com/problems/sum-of-mutated-array-closest-to-target/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1300.java) | |Medium||
+|1300|[Sum of Mutated Array Closest to Target](https://leetcode.com/problems/sum-of-mutated-array-closest-to-target/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1300.java) | |Medium|Binary Search, Sorting|
 |1299|[Replace Elements with Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1299.java) | |Easy||
 |1297|[Maximum Number of Occurrences of a Substring](https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1297.java) | |Medium||
 |1296|[Divide Array in Sets of K Consecutive Numbers](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1296.java) | |Medium||

src/main/java/com/fishercoder/solutions/_1300.java

@@ -4,8 +4,15 @@ public class _1300 {
     public static class Solution1 {
         public int findBestValue(int[] arr, int target) {
             int ave = target / arr.length;
-            int min = findMin(arr);
-            int max = findMax(arr);
+            int max = arr[0];
+            int min = arr[0];
+            for (int i = 1; i < arr.length; i++) {
+                min = Math.min(min, arr[i]);
+                max = Math.max(max, arr[i]);
+            }
+            if (ave >= max) {
+                return max;
+            }
             //if ave is the best value, what's the difference to target?
             int closetDiff = findClosestDiffIfReplaceWithVal(arr, ave, target);
             int bestValue = ave;
@@ -47,20 +54,5 @@ private int findClosestDiffIfReplaceWithVal(int[] arr, int replaceValue, int tar
             return Math.abs(sum - target);
         }
 
-        private int findMax(int[] arr) {
-            int max = arr[0];
-            for (int i = 1; i < arr.length; i++) {
-                max = Math.max(max, arr[i]);
-            }
-            return max;
-        }
-
-        private int findMin(int[] arr) {
-            int min = arr[0];
-            for (int i = 1; i < arr.length; i++) {
-                min = Math.min(min, arr[i]);
-            }
-            return min;
-        }
     }
 }

src/test/java/com/fishercoder/_1300Test.java

@@ -33,4 +33,40 @@ public void test3() {
         assertEquals(11361, solution1.findBestValue(arr, 56803));
     }
 
-}
+    @Test
+    public void test4() {
+        arr = new int[]{2, 3, 5};
+        assertEquals(5, solution1.findBestValue(arr, 11));
+    }
+
+    @Test
+    public void test5() {
+        arr = new int[]{60864, 25176, 27249, 21296, 20204};
+        assertEquals(11361, solution1.findBestValue(arr, 56803));
+    }
+
+    @Test
+    public void test6() {
+        arr = new int[]{48772, 52931, 14253, 32289, 75263};
+        assertEquals(8175, solution1.findBestValue(arr, 40876));
+    }
+
+    @Test
+    public void test7() {
+        arr = new int[]{1547, 83230, 57084, 93444, 70879};
+        assertEquals(17422, solution1.findBestValue(arr, 71237));
+    }
+
+    @Test
+    public void test8() {
+        arr = new int[]{1, 1, 2};
+        assertEquals(2, solution1.findBestValue(arr, 10));
+    }
+
+    @Test
+    public void test9() {
+        arr = new int[]{1, 1, 1};
+        assertEquals(1, solution1.findBestValue(arr, 10));
+    }
+
+}