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

    Approach #1: Math. [Java]

    class Solution {
        public String optimalDivision(int[] nums) {
            if (nums.length == 1) 
                return Integer.toString(nums[0]);
            if (nums.length == 2) 
                return Integer.toString(nums[0]) + "/" + Integer.toString(nums[1]);
            StringBuilder sb = new StringBuilder();
            sb.append(nums[0]);
            sb.append("/(");
            for (int i = 1; i < nums.length; ++i) sb.append(nums[i] + "/");
            
            return sb.deleteCharAt(sb.length()-1).append(")").toString();
        }
    }
    

      

    Analysis:

    x1 / x2 / x3 .. / xn will always be equal to (x1 / x2) * Y, no matter how you place parentheses. i.e no matter how you place parentheses, x1 always goes to the numerator and x2 always goes to the denominator.Hence you just need to maximize Y. And Y is maximized when it is equal to x3 * x4 * .. * xn. So the answer is always x1 / (x2 / x3 .. / xn) = (x1 * x2 * .. * xn) / x2

    Reference:

    https://leetcode.com/problems/optimal-division/discuss/101687/Easy-to-understand-simple-O(n)-solution-with-explanation

    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    Qt Qwt之坐标轴移动
    Lnux 16.04 VM下安装与汉化
    【学习笔记】开源日志记录工具log4j使用方法
    【学习笔记】关于DOM4J:使用DOM4J解析XML文档
    DOM的概念和简单应用:使用DOM解析XML数据
    初识Socket通信:基于TCP和UDP协议学习网络编程
    java 中的Scanner
    跟着前辈学编程
    集合应用案例:编写程序实现学生信息管理系统的录入登录
    简单Java程序向实用程序的过度:二进制文件的读写
  • 原文地址:https://www.cnblogs.com/h-hkai/p/10742986.html
Copyright © 2011-2022 走看看