zoukankan      html  css  js  c++  java
  • LC 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:

    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.

    Runtime: 4 ms, faster than 34.01% of C++ online submissions for Optimal Division.

    class Solution {
    public:
        string optimalDivision(vector<int>& nums) {
          if(nums.size() == 1) return to_string(nums[0]);
          if(nums.size() == 2) return to_string(nums[0]) + "/" + to_string(nums[1]);
          string ret = "";
          ret += to_string(nums[0]) + "/(";
          for(int i=1; i<nums.size(); i++){
            ret += to_string(nums[i]) + "/";
          }
          ret = ret.substr(0,ret.size()-1);
          ret += ")";
          return ret;
        }
    };
  • 相关阅读:
    Hosts文件的使用
    【java】关于时间
    【java】定时器
    log4j2的使用
    【springMVC】简单的前后端数据交流
    springMVC简单示例
    442. Find All Duplicates in an Array
    448. Find All Numbers Disappeared in an Array Add to List
    xml scheme 示例解析
    《C#高效编程》读书笔记04-使用Conditional特性而不是#if条件编译
  • 原文地址:https://www.cnblogs.com/ethanhong/p/10195683.html
Copyright © 2011-2022 走看看