refactor 1362

fishercoder1534 · fishercoder1534 · commit 85e2e0842b7e · 2020-10-16T06:49:24.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1362.java b/src/main/java/com/fishercoder/solutions/_1362.java
@@ -1,27 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 1362. Closest Divisors
- *
- * Given an integer num, find the closest two integers in absolute difference whose product equals num + 1 or num + 2.
- * Return the two integers in any order.
- *
- * Example 1:
- * Input: num = 8
- * Output: [3,3]
- * Explanation: For num + 1 = 9, the closest divisors are 3 & 3, for num + 2 = 10, the closest divisors are 2 & 5, hence 3 & 3 is chosen.
- *
- * Example 2:
- * Input: num = 123
- * Output: [5,25]
- *
- * Example 3:
- * Input: num = 999
- * Output: [40,25]
- *
- * Constraints:
- * 1 <= num <= 10^9
- * */
 public class _1362 {
     public static class Solution1 {
         public int[] closestDivisors(int num) {
