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.

题意理解：
给定一个矩形的面积，设计出符合面积大小的长和宽，要求长和宽均为正整数，且长和宽之差尽可能小。（长大于等于宽）

这种题目很基础，先求平方根，再判定长和宽是否同时满足整数的条件，再一次递减1，直到满足条件。
最终运行时间超过39.42% cpp submissions， 还是有改进的空间。

c++:

class Solution {
public:
    vector<int> constructRectangle(int area) {
        vector<int> lw;
        double W = sqrt(area);
        if(int(W)==W)
        {
            lw.push_back(W);
            lw.push_back(area/W);
            return lw;
        }
        else
        {
            W = int(W);
            for(int i=W;i>0;i--)
            {
                if(area%i==0)
                {
                    lw.push_back(area/i);
                    lw.push_back(i);
                    return lw;
                }
            }
        }
    }
};

同样的思路，运行时间并没有缩短(?)，但是代码简洁很多：
Top Solution:

class Solution {
public:
    vector<int> constructRectangle(int area) {
        vector<int> lw;
        int w = sqrt(area);
        while(area%w!=0)   w--;
        lw.push_back(area/w);
        lw.push_back(w);
        return lw;
    }
};