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

题目大意：
给定一个矩形面积(0< area <=10000000，正整数)，输出 [长,宽]
(长宽必须是整数)
要求：长宽差距尽量小，长>=宽

C++

#include <iostream>
#include <vector>
using namespace std;

class Solution {
public:
    vector<int> constructRectangle(int area){
        vector<int> Array(2);
       if(area<=0 || area>10000000)//输入不合法时的情况
       {
            return Array;
       }
        int temp = 0;
        for(int i=1; i<=area; i++)
        {
            if(area%i == 0)//找到area的因数时
            {
                Array[0] = i;
                Array[1] = area/i;
                if(i == temp)//不能和上两行交换位置，因为要求输出Array[1]<=Array[0]
                    return Array;
                if(Array[0] == Array[1])
                    return Array;
                temp = Array[1];
            }
        }
        return Array;
    }
};
int main()
{
    cout << "Hello world!" << endl;
    return 0;
}

注意：
1.做完后查别人的代码，发现可以开根号，这样做效率更高
2.附上链接http://blog.youkuaiyun.com/liuchuo/article/details/54669517