Commit85e2e08

committed

refactor 1362

1 parent04e0517 commit85e2e08Copy full SHA for 85e2e08

File tree

-22

lines changed

-22

lines changed

Lines changed: 0 additions & 22 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,27 +1,5 @@`
`1`	`1`	`packagecom.fishercoder.solutions;`
`2`	`2`
`3`		`-/**`
`4`		`- * 1362. Closest Divisors`
`5`		`- *`
`6`		`- * Given an integer num, find the closest two integers in absolute difference whose product equals num + 1 or num + 2.`
`7`		`- * Return the two integers in any order.`
`8`		`- *`
`9`		`- * Example 1:`
`10`		`- * Input: num = 8`
`11`		`- * Output: [3,3]`
`12`		`- * 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.`
`13`		`- *`
`14`		`- * Example 2:`
`15`		`- * Input: num = 123`
`16`		`- * Output: [5,25]`
`17`		`- *`
`18`		`- * Example 3:`
`19`		`- * Input: num = 999`
`20`		`- * Output: [40,25]`
`21`		`- *`
`22`		`- * Constraints:`
`23`		`- * 1 <= num <= 10^9`
`24`		`- * */`
`25`	`3`	`publicclass_1362 {`
`26`	`4`	`publicstaticclassSolution1 {`
`27`	`5`	`publicint[]closestDivisors(intnum) {`

Comments

(0)