【Leetcode】492. Construct the Rectangle

最新推荐文章于 2021-04-25 19:02:01 发布

a_Huiii

最新推荐文章于 2021-04-25 19:02:01 发布

阅读量88

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/A_Huiii/article/details/99651508

本文介绍了一种用于设计网页尺寸的算法，确保长度L和宽度W满足特定条件：面积等于目标值，L>=W且L与W之差尽可能小。通过遍历和平方根运算，找到最合适的长宽比。

题目：

For a web developer, it is very important to know how to design a web page’s size. So, given a specific rectangular web page’s area, your job by now is to design a rectangular web page, whose length L and width W satisfy the following requirements:

The area of the rectangular web page you designed must equal to the given target area.
The width W should not be larger than the length L, which means L >= W.
The difference between length L and width W should be as small as possible.

注意：

他说You need to output the length L and the width W of the web page you designed in sequence.
思路是（int）平方，然后遍历把符合条件的一遍遍替代存进去，最后一个肯定是相差最小的。

**Code：

public int[] constructRectangle(int area) {
    int [] res = new int[2];
    int l = 0;
    int w = 0;
for(int i=1;i<=(int)Math.sqrt(area);i++){
    if(area%i==0){
        w= i;
        l = area/i;
    }
    res[0] = l;
    res[1] = w;
        
}
    return res;
}