描述
A web developer needs 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.
Return an array [L, W] where L and W are the length and width of the web page you designed in sequence.
Example 1:
Input: area = 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.
Example 2:
Input: area = 37
Output: [37,1]
Example 3:
Input: area = 122122
Output: [427,286]
Example 4:
Example 5:
Note:
1 <= area <= 107
解析
根据题意，就是找可以整除的两个数，前一个比后一个大，且两个的差最小。其实就是先对 area 开平方，如果能成功开平方为 t ，则直接返回结果 [t,t] 。如果没有成功，则对 t 减一形成 n ，判断 n 是否被能 area 整除，如果能整除，则返回 [int(area/n),n] ，如果不能则继续 t 减一判断是否整除的过程。
解答
class Solution(object):
def constructRectangle(self, area):
"""
:type area: int
:rtype: List[int]
"""
n = int(math.sqrt(area))
while area % n != 0:
n -= 1
return [int(area/n),n]
运行结果
Runtime: 20 ms, faster than 72.12% of Python online submissions for Construct the Rectangle.
Memory Usage: 13.3 MB, less than 91.35% of Python online submissions for Construct the Rectangle.
原题链接：leetcode.com/problems/co…
您的支持是我最大的动力
