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

1. The web page's width and length you designed must be positive integers.

题目的要求是给定一个area,求出它的长和宽，同时要求长宽的差值最小。按照常理是从1到area来整除area查找因子，但是在这里可以发现其实从area开放后即是重复的操作，因此最大检测到area开方+1。

class Solution {
public:
    vector<int> constructRectangle(int area) {
       vector<int> result;
       if(area <= 0) return result;
       int base = sqrt(area);
       int templ = area;
       int tempw = 1;
       int dis = area-1;
       for(int i=2;i<base+1;i++)
       {
           if(area%i == 0)
           {
               if(area/i-i<dis)
               {
                   dis = area/i-i;
                   templ = area/i;
                   tempw = i;
               }
               
           }
           
       }
       result.push_back(templ);
       result.push_back(tempw);
       return result;
    }
};