g0401_0500.s0492_construct_the_rectangle.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java17 Show documentation
Show all versions of leetcode-in-java17 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
package g0401_0500.s0492_construct_the_rectangle;
// #Easy #Math #2022_07_21_Time_1_ms_(74.88%)_Space_42_MB_(8.37%)
public class Solution {
/*
Algorithm:
- start with an index i from the square root all the way to 1;
- if at any time, area % i == 0 (so i is a divisor of area), then it's the closest solution.
*/
public int[] constructRectangle(int area) {
int low = (int) Math.sqrt(area);
while (low > 0) {
if (area % low == 0) {
return new int[] {area / low, low};
}
low--;
}
return new int[] {0, 0};
}
}