553. Optimal Division

Posted 2020-09-21 Sindyang

题目：

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:

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.

 

思路：

　　存在这样一个基本事实：X1/X2/X3/……/Xn = X1/X2*Y，也就是说对于X1/X2/X3/……/Xn，无论怎样加括号，总是可以表示成X1/X2*Y的形式。若要使得X1/X2/X3/……/Xn的值最大，则Y值应该最大。当Y=X3*x4……*Xn时，可以得到最大值。

　　当Y为最大值时，X1/X2*Y = X1*X3*X4……*Xn/X2 = X1/（X2/X3/X4……/Xn）。

 

代码：

 1 class Solution(object):
 2     def optimalDivision(self, nums):
 3         """
 4         :type nums: List[int]
 5         :rtype: str
 6         """
 7         if len(nums) == 1:
 8             return str(nums[0])
 9         elif len(nums) == 2:
10             return str(nums[0])+\'/\'+str(nums[1])
11         else:
12             result=""
13             for i in range(len(nums)-1):
14                 result += str(nums[i])+\'/\'
15                 if i == 0:
16                     result += \'(\'
17             result += str(nums[len(nums)-1])+\')\'
18             return result
19                
20                 

 

参考：

http://www.cnblogs.com/hellowooorld/p/6807513.html