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 page,
 6  whose length L and width W satisfy the following requirements:
 7
 8 1. The area of the rectangular web page you designed must equal to the given target area.
 9
10 2. The width W should not be larger than the length L, which means L >= W.
11
12 3. The difference between length L and width W should be as small as possible.
13 You need to output the length L and the width W of the web page you designed in sequence.
14 Example:
15 Input: 4
16 Output: [2, 2]
17 Explanation: The target area is 4, and all the possible ways to construct it are [1,4], [2,2], [4,1].
18 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.
19 Note:
20 The given area won‘t exceed 10,000,000 and is a positive integer
21 The web page‘s width and length you designed must be positive integers.
22  */
23
24 public class constructRectangle492 {
25     public static int[] constructRectangle(int area) {
26         int wid=(int)Math.sqrt(area);
27         int len=wid;
28         for(;wid>0;wid--){
29             if(area/wid*wid==area){
30                 len=area/wid;
31                 break;
32             }
33         }
34         int[] web={len,wid};
35         return web;
36     }
37     //study return 可以简写成new int[]{len,wid}
38     //study if判断语句里面可以用%来判断
39
40     public static void main(String[] args) {
41         // TODO Auto-generated method stub
42         System.out.println(constructRectangle(4)[0]+" and "+constructRectangle(4)[1]);
43         System.out.println(constructRectangle(5)[0]+" and "+constructRectangle(5)[1]);
44     }
45
46 }
时间: 2024-08-05 22:02:30

LeetCode:492. Construct the Rectangle的相关文章

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&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

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 构建矩形

详见: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}; }

[LeetCode] 492. Construct the Rectangle_Easy tag: Math

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_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 OJ - construct Binary Tree from Inorder and Postorder/Preorder Traversal

不断递归的实现!!!! 下面是AC代码: 1 /** 2 * Given inorder and postorder traversal of a tree, construct the binary tree. 3 * @param inorder 4 * @param postorder 5 * @return 6 */ 7 public TreeNode buildTree(int[] inorder,int[] postorder){ 8 if(inorder == null || po

leetcode第一刷_Largest Rectangle in Histogram

很难的问题,数组线性时间. 属于我之前说的解法的借助辅助空间.给定两个柱子,他们之间的面积由什么确定呢?没错,他们之间的距离和他们之间最矮的那个柱子的高度.我们并不知道这个柱子在什么位置,所以只能遍历,这个复杂度就上去了.那有没有一个方法避免找中间小柱子呢?先想什么情况下不用找.除非你知道枚举出两个位置之间的柱子都比现在这个长.所以想到了用一个栈来保存较长的那些柱子编号.需要保证的一件事是栈里面的柱子高度一定是递增的,每次计算面积的时候是从当前位置往前计算的,计算一次弹出一次,每次都使用栈顶的高

LeetCode[Tree]: Construct Binary Tree from Inorder and Postorder Traversal

Given inorder and postorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree. 这个题目的解法与LeetCode[Tree]: Construct Binary Tree from Preorder and Inorder Traversal的解法几乎相差无几.我的C++代码实现如下: class S