leetcode 241. Different Ways to Add Parentheses
来源:互联网 发布:编程需要什么样的cpu 编辑:程序博客网 时间:2024/06/16 13:08
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 *.
Example 1
Input: "2-1-1".
((2-1)-1) = 0
(2-(1-1)) = 2
Output: [0, 2]
Example 2
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
Example 1
Input: "2-1-1".
((2-1)-1) = 0
(2-(1-1)) = 2
Output: [0, 2]
Example 2
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]
思路是 divide and conquer 就是拆分成两个部分,然后在组装在一起
class Solution {public: vector<int> diffWaysToCompute(string input) { vector<int> ret; for(int i = 0; i < input.size(); i++) { if (input[i]=='+' || input[i]=='-' || input[i]=='*') { 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 (input[i]=='+') ret.push_back(left[j] + right[k]); else if (input[i]=='-') ret.push_back(left[j] - right[k]); else if (input[i]=='*') ret.push_back(left[j] * right[k]); } } } } if(ret.empty()) ret.push_back(atoi(input.c_str())); return ret; }};
阅读全文
0 0
- [leetcode] 241.Different Ways to Add Parentheses
- Leetcode-241.Different Ways to Add Parentheses
- 241. Different Ways to Add Parentheses LeetCode
- Leetcode- 241.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 241. 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] 241. 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】241. Different Ways to Add Parentheses
- 【LeetCode】 241. Different Ways to Add Parentheses
- [LeetCode]241. Different Ways to Add Parentheses
- Android Studio SVN 使用方法
- UX设计师害怕报告怎么办
- CSS布局
- 在controller和util中调用服务器中的文件总结
- KMP算法理解
- leetcode 241. Different Ways to Add Parentheses
- Net的wsdl生成webservice 异常:undefined simple or complex type 'soapenc:Array'
- 关于ffi安装失败的解决办法
- [JSP] c:forEach 如何输出序号
- 计算机网络01_一些理解
- Eclipse运行项目后在自定义浏览器打开页面
- Unicode 和 UTF-8 有何区别?
- 在unbutu14.04上创建一个应用的快捷方式
- 简单的计数器