241. Different Ways to Add Parentheses

最新推荐文章于 2021-11-19 22:29:55 发布

hling_so

最新推荐文章于 2021-11-19 22:29:55 发布

阅读量190

点赞数

分类专栏： LeetCode 算法分治算法

本文链接：https://blog.csdn.net/hling_so/article/details/78014733

版权

LeetCode 同时被 3 个专栏收录

56 篇文章 0 订阅

订阅专栏

算法

56 篇文章 0 订阅

订阅专栏

分治算法

6 篇文章 0 订阅

订阅专栏

题目描述

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

Output: [-34, -14, -10, -10, 10]
Credits:
Special thanks to @mithmatt for adding this problem and creating all test cases.

题意理解

给一串数学表达式的字符串,算出这个字符串加上任意合理括号之后的计算结果

递归解决

算法描述

将字符串从左往右遍历,每一个运算符+, - 或 * 都将字符串分割成两部分, 递归计算两边的结果,再将两边通过该运算符计算出来最后的结果.
边界条件为:字符串中只有数字,没有运算符

具体实现

class Solution {
public:
    vector<int> diffWaysToCompute(string input) {
        vector<int> result;
        for (int i = 0; i < input.size(); i++) {
            char cur = input[i];
            if (cur == '+' || cur == '-' || cur == '*') {
                vector<int> left = diffWaysToCompute(input.substr(0, i));
                vector<int> right = diffWaysToCompute(input.substr(i+1));
                for (auto l : left) {
                    for (auto r : right) {
                        if (cur == '+')
                            result.push_back(l + r);
                        else if (cur == '-')
                            result.push_back(l - r);
                        else if (cur == '*')
                            result.push_back(l * r);    
                    }
                }
            }
        }
        // bounded condition
        if(result.empty())
           result.push_back(atoi(input.c_str()));

        return result;
    }
};