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

在合适的位置添加上括号，使最大化除法表达式值。

除了第一个数是除数之外，后面的数都可转变为乘积。

1.只有一个数，直接返回； 
2.有两个数，第一个除以第二个返回； 
3.有三个及以上的数，把第二个数后面的和第一个数全部乘起来，最后除以第二个数。

 

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:

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

class Solution:
    def optimalDivision(self, nums):
        """
        :type nums: List[int]
        :rtype: str
        """  
        nums = list(map(str, nums))
        if len(nums) <= 2:
            return '/'.join(nums)
        else:
            return nums[0] + '/(' + '/'.join(nums[1 :]) + ')'