leetcode 553. Optimal Division
来源:互联网 发布:现代汉语词典知乎 编辑:程序博客网 时间:2024/06/05 07:35
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) = 200However, 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 = 501000/(100/(10/2)) = 501000/100/10/2 = 0.51000/100/(10/2) = 2
public class Solution { public String optimalDivision(int[] nums) { String str=""; if(nums.length==1)return nums[0]+""; if(nums.length==2)return nums[0]+"/"+nums[1]; for(int i=1;i<nums.length-1;i++){ str=str+nums[i]+"/"; } if(nums.length>1)str=str+nums[nums.length-1]; return nums[0]+"/"+"("+str+")"; }}
0 0
- leetcode 553. Optimal Division
- leetcode 553. Optimal Division
- LeetCode:553. Optimal Division
- leetcode 553. Optimal Division
- [leetcode]553. Optimal Division
- [LeetCode]553. Optimal Division
- LeetCode:553. Optimal Division
- leetcode 553. Optimal Division 最优除法
- [Leetcode] 553. Optimal Division 解题报告
- 553. Optimal Division
- 553. Optimal Division
- 553. Optimal Division
- 553. Optimal Division
- 553. Optimal Division
- 553. Optimal Division
- 553. Optimal Division
- 553. Optimal Division
- 553. Optimal Division
- 内网渗透随想
- Eclipse 使用fatjar打包jar文档
- Mac ffmpeg 安装
- 降级特技之配置中心
- xcode下载地址
- leetcode 553. Optimal Division
- java mapper.xml文件报错
- HDU 1584 蜘蛛牌(DFS)
- java操作redis数据库实例(redis集群)
- 怎么解决tomcat修改路径,重启tomcat的时候怎么避免多次重启
- 算法Map
- 分布式RPC框架性能大比拼
- Qt入门-layout布局
- Tornado 终极