即日起在codingBlog上分享您的技术经验即可获得积分,积分可兑换现金哦。

553. Optimal Division

编程语言 sinat_34652027 9℃ 0评论

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.
class Solution {
public:
    string optimalDivision(vector& nums) {
       string ans;
       int size =nums.size();
       ans = to_string(nums[0]);
       if(size ==1)return ans;
       if(size ==2)return ans.append("/").append(to_string(nums[1]));
       ans.append("/(").append(to_string(nums[1]));
       for(int i=2;i







转载请注明:CodingBlog » 553. Optimal Division

喜欢 (0)or分享 (0)
发表我的评论
取消评论

*

表情