leetcode 492 python

最新推荐文章于 2020-01-19 14:50:11 发布

原创最新推荐文章于 2020-01-19 14:50:11 发布 · 259 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

46 篇文章

订阅专栏

本文介绍了一种用于设计网页尺寸的算法，确保所设计的矩形网页面积等于指定的目标面积，并尽可能减少长度与宽度之间的差异。

摘要生成于 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(object):
def constructRectangle(self, area):
“””
:type area: int
:rtype: List[int]
“””
out = []
a = math.sqrt( area)
b = int(a)

    for x in range(b,0,-1):
        h = area//x
        print(h)
        if x * (h) == area:
            out.append(h)
            out.append(x)
            break
    return outtion(object):



def constructRectangle(self, area):
    """
    :type area: int
    :rtype: List[int]
    """
    mid = int(math.sqrt(area))
    while mid > 0:
        if area % mid == 0:
            return [(area // mid), int(mid)]
        mid -= 1