LeetCode-492. Construct the Rectangle (Java)

最新推荐文章于 2026-04-28 07:14:04 发布

原创最新推荐文章于 2026-04-28 07:14:04 发布 · 423 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#LeetCode #Construct the Rectan #Java

实实在在刷点题专栏收录该内容

60 篇文章

订阅专栏

本文介绍了一种用于设计网页尺寸的算法，确保所设计的长宽符合特定条件：面积匹配目标值、长度不小于宽度且两者差距最小。通过优化循环范围提高了算法效率。

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.

2. The width W should not be larger than the length L, which means L >= W.

3. 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.

----------------------------------------------------------------------------------------------------------------------------------------------------------------

这道题比较简单，需要了解的是循环的范围选取。代码如下：

public class Solution {
    public int[] constructRectangle(int area) {
        int width = 0;
		int length = 0;
		int difference = 0;
		int minDifference = Integer.MAX_VALUE;
		List<Integer> list = new ArrayList<>();
        for(int i =1;i<=Math.sqrt(area);i++){
        	if(area%i==0){
        		width = i;
        		length = area/i;
        		difference = length - width;
        		if(difference < minDifference){
        			list.clear();
        			list.add(length);
        			list.add(width);
        		}
        	}
        }
        int [] result = new int[list.size()];
        int j =0;
        for(Integer value : list){
        	result[j++] = value;
        }
        return result;
    }
}

for循环之所以是i<=Math.sqrt(area)，因为 num = a*b，则a,b必有一个大于根号x，有一个小于根号x，况且因子都是成对出现，所以只需判断根号x，可以减少循环次数，提高效率。