LEETCODE--Construct the Rectangle

最新推荐文章于 2021-04-15 17:31:20 发布

prettysky123

最新推荐文章于 2021-04-15 17:31:20 发布

阅读量281

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/prettysky123/article/details/54809525

leetcode 专栏收录该内容

137 篇文章

订阅专栏

本文介绍了一种用于设计网页尺寸的算法，确保所设计的长宽比接近正方形且符合特定面积要求。通过寻找最佳长宽比例，使得网页既美观又实用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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:
1. 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.

Example:
Input: 4
Output: [2, 2]
Explanation: The target area is 4, and all the possible ways to construct it are [1,4], [2,2], [4,1].
But according to requirement 2, [1,4] is illegal; according to requirement 3, [4,1] is not optimal compared to [2,2]. So the length L is 2, and the width W is 2.

class Solution {
public:
    vector<int> constructRectangle(int area) {
        int num = sqrt(area);
        int x;
        while(num > 0){
            if(area % num == 0){
                x = area / num;
                break;
            }
            num--;
        }
        if(x > num){
            int temp = num;
            num = x;
            x = temp;
        }
        vector<int> vec;
        vec.push_back(num);
        vec.push_back(x);
        return vec;
    }
};

解法2：

class Solution {
public:
    vector<int> constructRectangle(int area) {
        int a = sqrt(area);
        int b = a;
        while(a * b != area){
            if(a * b > area)
                b--;
            if(a * b < area)
                a++;
        }
        vector<int> vec;
        vec.push_back(a);
        vec.push_back(b);
        return vec;
    }
};