492. 构造矩形 Construct the Rectangle

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.

Note:

  1. The given area won‘t exceed 10,000,000 and is a positive integer
  2. The web page‘s width and length you designed must be positive integers.

给定矩形的面积area,返回矩形的长度L和宽度W,使得L和W的差值最小。

  1. public class Solution {
  2. public int[] ConstructRectangle(int area) {
  3. if (area == 0) {
  4. int[] arr = { };
  5. return arr;
  6. }
  7. int[] result = { area, 1 };
  8. for(int height = 1; height <= area; height++) {
  9. if (area % height == 0) {
  10. int width = area / height;
  11. if (width < height) {
  12. break;
  13. }else if (width - height < result[0] - result[1]) {
  14. result[0] = width;
  15. result[1] = height;
  16. }
  17. }
  18. }
  19. return result;
  20. }
  21. }

null

时间: 2024-08-06 15:39:51

492. 构造矩形 Construct the Rectangle的相关文章

LeetCode:492. Construct the Rectangle

1 package Today; 2 //LeetCode:492. Construct the Rectangle 3 /* 4 For a web developer, it is very important to know how to design a web page's size. 5 So, given a specific rectangular web page's area, your job by now is to design a rectangular web pa

LeetCode_492. Construct the Rectangle

492. Construct the Rectangle Easy 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 sat

LeetCode 84--柱状图中最大的矩形( Largest Rectangle in Histogram) 85--最大矩形(Maximal Rectangle)

84题和85五题 基本是一样的,先说84题 84--柱状图中最大的矩形( Largest Rectangle in Histogram) 思路很简单,通过循环,分别判断第 i 个柱子能够延展的长度len,最后把len*heights[i] 就是延展开的面积,最后做比对,得出最大. public int largestRectangleArea(int[] heights) { int ans=0; for(int i=0;i<heights.length;i++) { int len=1,lef

1209. Construct the Rectangle

1209. Construct the Rectangle class Solution { public: /** * @param area: web pagea€?s area * @return: the length L and the width W of the web page you designed in sequence */ vector<int> constructRectangle(int area) { // Write your code here int st

492 Construct the Rectangle 构建矩形

详见:https://leetcode.com/problems/construct-the-rectangle/description/ C++: class Solution { public: vector<int> constructRectangle(int area) { int l=sqrt(area),w=sqrt(area); while(l*w!=area) { if(l*w<area) { ++l; } else { --w; } } return {l,w}; }

492. Construct the Rectangle

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

492. Construct the Rectangle(LeetCode)

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

[LeetCode&amp;Python] Problem 492. Construct the Rectangle

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

最大的矩形面积 Maximal Rectangle

2018-09-15 10:23:44 一.Largest Rectangle in Histogram 在求解最大的矩形面积之前,我们先讨论一条最大直方图面积的问题. 问题描述: 问题求解: 解法一.朴素解法,O(n ^ 2). 解决的思路就是遍历一遍,如果当前的数比后一个数要小,那么当前的额数字肯定不可能是最大面积的右边界,遍历下一个数: 如果当前数比后一个大,那么假设当前的为右边界,向左进行遍历,计算面积最大值. public int largestRectangleArea(int[]