241-Different ways to add parentheses

最新推荐文章于 2022-06-08 16:42:14 发布

晨识草

最新推荐文章于 2022-06-08 16:42:14 发布

阅读量272

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/lichen_yun/article/details/78998892

版权

leetcode 专栏收录该内容

65 篇文章 0 订阅

订阅专栏

类别：divide and conquer

难度：medium

题目描述

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]

代码实现

class Solution {
public:
    vector<int> diffWaysToCompute(string input) {
        vector<int> result;
        for (int i = 0; i < input.size(); ++i) {
            if (!(input[i] >= '0' && input[i] <= '9')) {
                vector<int> left = diffWaysToCompute(input.substr(0, i));
                vector<int> right = diffWaysToCompute(input.substr(i + 1));
                for (int l = 0; l < left.size(); ++l) {
                    for (int r = 0; r < right.size(); ++r) {
                        switch(input[i]) {
                            case '+':
                                result.push_back(left[l] + right[r]);
                                break;
                            case '-':
                                result.push_back(left[l] - right[r]);
                                break;
                            case '*':
                                result.push_back(left[l] * right[r]);
                                break;
                        }
                    }
                }  
            }
        }
        if (result.empty()) {
            result.push_back(atoi(input.c_str()));
        }
        return result;
    }
};