fix build

fishercoder1534 · fishercoder1534 · commit cdfb3672b308 · 2020-11-07T18:14:55.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_1283.java b/src/main/java/com/fishercoder/solutions/_1283.java
@@ -1,32 +1,33 @@
 package com.fishercoder.solutions;
 
 public class _1283 {
-    public static class Solution{
-        private boolean isSumLessThanThreshold(int middle, int[] nums, int threshold){
-            int sum = 0;
-            for(int i = 0; i<nums.length; i++){
-                if(nums[i] % middle == 0)
-                    sum += nums[i]/middle;
-                else
-                    sum += nums[i]/middle + 1;
-            }
-            return sum <= threshold;
-        }
+    public static class Solution {
+
         public int smallestDivisor(int[] nums, int threshold) {
 
             int start = 1, result = 0;
             int end = Integer.MAX_VALUE;
-            while(start <= end){
-                int middle = start + (end - start)/2;
-                if(isSumLessThanThreshold(middle, nums, threshold)){
+            while (start <= end) {
+                int middle = start + (end - start) / 2;
+                if (isSumLessThanThreshold(middle, nums, threshold)) {
                     result = middle;
                     end = middle - 1;
-                }
-                else{
+                } else {
                     start = middle + 1;
                 }
             }
             return result;
         }
+
+        private boolean isSumLessThanThreshold(int middle, int[] nums, int threshold) {
+            int sum = 0;
+            for (int i = 0; i < nums.length; i++) {
+                if (nums[i] % middle == 0)
+                    sum += nums[i] / middle;
+                else
+                    sum += nums[i] / middle + 1;
+            }
+            return sum <= threshold;
+        }
     }
 }
diff --git a/src/test/java/com/fishercoder/_1283Test.java b/src/test/java/com/fishercoder/_1283Test.java
@@ -1,32 +1,31 @@
 package com.fishercoder;
 
-import com.fishercoder.common.utils.TreeUtils;
 import com.fishercoder.solutions._1283;
 import org.junit.BeforeClass;
 import org.junit.Test;
 
-import java.util.Arrays;
-
 import static junit.framework.TestCase.assertEquals;
 
 public class _1283Test {
     private static _1283.Solution solution;
     private static int[] nums;
     private static int threshold;
+
     @BeforeClass
     public static void setup() {
         solution = new _1283.Solution();
     }
 
     @Test
     public void test1() {
-        nums = new int []{1,2,5,9};
+        nums = new int[]{1, 2, 5, 9};
         threshold = 6;
         assertEquals(5, solution.smallestDivisor(nums, threshold));
     }
+
     @Test
     public void test2() {
-        nums = new int []{2,3,5,7,11};
+        nums = new int[]{2, 3, 5, 7, 11};
         threshold = 11;
         assertEquals(3, solution.smallestDivisor(nums, threshold));
     }
