553. Optimal Division
来源:互联网 发布:结构优化设计 编辑:程序博客网 时间:2024/05/23 16:39
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
Note:
- The length of the input array is [1, 10].
- Elements in the given array will be in range [2, 1000].
- There is only one optimal division for each test case.
class Solution {public: string optimalDivision(vector<int>& 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<size;i++){ ans.append("/").append(to_string(nums[i])); } ans.append(")"); return ans; }};
阅读全文
0 0
- leetcode 553. Optimal Division
- 553. Optimal Division
- 553. Optimal Division
- leetcode 553. Optimal Division
- 553. Optimal Division
- LeetCode:553. Optimal Division
- 553. Optimal Division
- 553. Optimal Division
- leetcode 553. Optimal Division
- 553. Optimal Division
- 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
- 让浏览器记住ajax请求并能前进和后退方法(一)
- 变量——JavaScript
- python成绩统计(优化版)
- Android发送邮件
- java初学--数组
- 553. Optimal Division
- 南阳理工29题
- kotlin基础
- 如何将Emmet安装到到 Sublime text 3?
- 键盘输入3*3的整数矩阵,分别求两条对角线元素的和,使用行指针变量实现。
- PHP关键字
- Android集训第一天(补)
- Libevent源码分析-----开篇
- java初学--36选7