add 1362

fishercoder1534 · fishercoder1534 · commit e15daaf1762e · 2020-02-23T04:42:49.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1362|[Closest Divisors](https://leetcode.com/problems/closest-divisors/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1362.java) | |Medium||Math
 |1361|[Validate Binary Tree Nodes](https://leetcode.com/problems/validate-binary-tree-nodes/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1361.java) | |Medium||Graph
 |1360|[Number of Days Between Two Dates](https://leetcode.com/problems/number-of-days-between-two-dates/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1360.java) | |Easy||
 |1358|[Number of Substrings Containing All Three Characters](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1358.java) | |Medium|String|
diff --git a/src/main/java/com/fishercoder/solutions/_1362.java b/src/main/java/com/fishercoder/solutions/_1362.java
@@ -0,0 +1,43 @@
+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) {
+            int sqrt = (int) Math.sqrt(num);
+            int left = sqrt + 1;
+            int right = sqrt + 1;
+            long product = left * right;
+            while (product != (long) (num + 1) && product != (long) (num + 2)) {
+                if (product < (num + 1)) {
+                    left++;
+                } else if (product > (num + 2)) {
+                    right--;
+                }
+                product = left * right;
+            }
+            return new int[]{left, right};
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1362Test.java b/src/test/java/com/fishercoder/_1362Test.java
@@ -0,0 +1,33 @@
+package com.fishercoder;
+
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions._1362;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+
+public class _1362Test {
+    private static _1362.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1362.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        CommonUtils.printArray(solution1.closestDivisors(8));
+    }
+
+    @Test
+    public void test2() {
+        CommonUtils.printArray(solution1.closestDivisors(123));
+    }
+
+    @Test
+    public void test3() {
+        CommonUtils.printArray(solution1.closestDivisors(999));
+    }
+
+}
