leetcode 553. Optimal Division 添加括号 + 最优除法

Given a list of positive integers, the adjacent integers will perform the float division. For example, [2,3,4] -> 2 / 3 / 4.

However, you can add any number of parenthesis at any position to change the priority of operations. You should find out how to add parenthesis to get the maximum result, and return the corresponding expression in string format. Your expression should NOT contain redundant parenthesis.

Example:
Input: [1000,100,10,2]
Output: “1000/(100/10/2)”
Explanation:
1000/(100/10/2) = 1000/((100/10)/2) = 200
However, the bold parenthesis in “1000/((100/10)/2)” are redundant,
since they don’t influence the operation priority. So you should return “1000/(100/10/2)”.

Other cases:
1000/(100/10)/2 = 50
1000/(100/(10/2)) = 50
1000/100/10/2 = 0.5
1000/100/(10/2) = 2
Note:

The length of the input array is [1, 10].
Elements in the given array will be in range [2, 1000].
There is only one optimal division for each test case.

题意很简单，就是求添加括号的位置使计算的值最大

　这道题非常tricky，我们注意到除了第一个除数之外，后面的数都可以转变为乘积！！！
　　拿样例来说：
　　1000/(100/10/2) == (1000*10*2)/(100)
　　所以，我们只需要考虑三种情况：
　　1.只有一个数，直接返回；
　　2.有两个数，第一个除以第二个返回；
　　3.有三个及以上的数，把第二个数后面的和第一个数全部乘起来，最后除以第二个数。（因为note当中说明了，给的数字都是[2,1000]的，所以第二个数后面的所有数乘起来都只会让结果变大），那么做起来就十分的简单了

代码如下：

#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <climits>
#include <algorithm>
#include <sstream>
#include <functional>
#include <bitset>
#include <numeric>
#include <cmath>

using namespace std;


class Solution 
{
public:
    string optimalDivision(vector<int>& nums) 
    {
        if (nums.size() <= 0)
            return "";
        else if (nums.size() == 1)
            return to_string(nums[0]);
        else if (nums.size() == 2)
            return to_string(nums[0]) + "/" + to_string(nums[1]);

        string res = to_string(nums[0]) + "/";
        string tmp = to_string(nums[1]);
        for (int i = 2; i < nums.size(); i++)
            tmp = tmp + "/" + to_string(nums[i]);

        res = res + "(" + tmp + ")";
        return res;
    }

};