【算法作业2】LeetCode 492. Construct the Rectangle

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.

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

题解：

此题是给定一个长方形的面积，求可以组成长方形的长和宽，并满足：长大于宽、长宽之差最小。

我的思路是，既然要求长宽之差最小，那么最理想的情况是正方形，那么就应该从面积的开根号开始检验，逐渐减小，如果发现该数字是面积的因数，那么该数字就是所要求的宽长度（由于是从面积的根号往下检验，所以检验出的数字必定为宽的长度）。

代码：

#include <cmath>
class Solution {
public:
    vector<int> constructRectangle(int area) {
        vector<int> size;
        for (int i = sqrt(area); i > 0; i--)
        {
            if (area % i == 0)
            {
                size.push_back(area / i);
                size.push_back(i);
                break;
            }
        }
        return size;
    }
};