Divide and Conquer -- Leetcode problem241:Different Ways to Add Parentheses
来源:互联网 发布:linux 九九乘法表对齐 编辑:程序博客网 时间:2024/05/29 10:34
- 描述:Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +, - and *.
Example1
input:2-1-1
((2-1)-1) = 0
(2-(1-1)) = 2
output:[0,2]
Example2
input:2*3-4*5
(2*(3-(4*5))) = -34
((2*3)-(4*5)) = -14
((2*(3-4))*5) = -10
(2*((3-4)*5)) = -10
(((2*3)-4)*5) = 10
output:[-34, -14, -10, -10, 10]
- 分析:这道题顾名思义是给表达式添加符号的问题,如果穷举出各种可能的加括号情况,很可能会产生重复或者遗漏的问题。并且这道题只需要加圆括号,因此加括号的位置不用考虑。所以可以把这个String类型的表达式根据每一运算符分为左右两边分别进行运算。
- 思路一:直接选用分治法进行运算。
class Solution {public: vector<int> diffWaysToCompute(string input) { vector<int> result; int size = input.size(); for (int i = 0; i < size; i++) { char temp = input[i]; if (temp == '+' || temp == '-' || temp == '*') { vector<int> left = diffWaysToCompute(input.substr(0, i)); vector<int> right = diffWaysToCompute(input.substr(i+1)); for (int j = 0 ; j < left.size(); j++) { for (int k = 0; k < right.size(); k++) { if (temp == '+') result.push_back(left[j] + right[k]); else if (temp == '-') result.push_back(left[j] - right[k]); else result.push_back(left[j] * right[k]); } } } } if (result.empty()) result.push_back(stoi(input)); return result; }};
阅读全文
0 0
- Divide and Conquer -- Leetcode problem241:Different Ways to Add Parentheses
- [Divide and Conquer]241. Different Ways to Add Parentheses
- 【算法】【Divide and conquer】Different Ways to Add Parentheses
- 241. Different Ways to Add Parentheses(divide and conquer)
- Divide and Conquer:241. Different Ways to Add Parentheses
- Leetcode divide & conquer || Different Ways to Add Parentheses
- leetCode刷题归纳-Divide and Conquer(241. Different Ways to Add Parentheses)
- leetcode_c++:Divide and Conquer:Different Ways to Add Parentheses(241)
- Divide and Conquer (1) -- Kth Largest Element in an Array,Different Ways to Add Parentheses
- leetcode 241 Different Ways to Add Parentheses
- Leetcode 241- Different Ways to Add Parentheses
- Leetcode #241 Different Ways to Add Parentheses
- LeetCode - Different Ways to Add Parentheses
- [leetCode] Different Ways to Add Parentheses
- [leetcode 241]Different Ways to Add Parentheses
- Leetcode|Different Ways to Add Parentheses
- [leetcode][dfs] Different Ways to Add Parentheses
- LeetCode Different Ways to Add Parentheses
- 数据结构第二周三种传递方法
- 如何给input中text类型设置css
- 第二周项目2-程序的多文件组织
- SpringBoot热启动
- Elam的caffe笔记之配置篇(三):Centos 6.5下装CUDA8.0 和cudnnv5.1
- Divide and Conquer -- Leetcode problem241:Different Ways to Add Parentheses
- MD5处理的几种方式
- HTML学习心得(一)
- 搜狗输入法Linux版配置文件详解
- caffe训练模型后,使用模型测试的分类结果全部都是相同的
- 内存泄漏及内存溢出
- inflate.inflate(R.layout.xxxx,null); 报空指针异常
- 多层nginx代理tomcat获取客户端真实ip
- 计算机核心期刊排名及投稿信息