Leetcode 241. Different Ways to Add Parentheses

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

vincentCheungM

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

阅读量267

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/github_37606447/article/details/60323097

版权

leetcode 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

source url

Leetcode 53.Maximum Subarray

source url

题目描述

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 *.
输入：一个算式，字符串形式
输出：该数组中，不同运算顺序的结果
如：

Input:"2-1-1"

((2-1)-1) = 0
(2-(1-1)) = 2

Output:[0, 2]

代码

class Solution {
public:
    vector<int> diffWaysToCompute(string input) {
        vector<int> results, l, r;
        int sSize = input.length();
        char cur;
        bool isAllInt = true;

        for(int i = 0;i<sSize;i++){
            cur = input[i];
            //if cur char is an operator : '+', '-' or '*'
            //get different ways computed values of left sub-string and right sub-string
            //calculate possible results from l`Operate`r 
            if(cur=='-'||cur=='+'||cur=='*'){
                isAllInt = false;
                l = diffWaysToCompute(input.substr(0,i));
                r = diffWaysToCompute(input.substr(i+1,sSize));
                for(int i =0;i<l.size();i++)
                    for(int j=0;j<r.size();j++)
                        results.push_back(cur=='-'?l[i]-r[j]:cur=='+'?l[i]+r[j]:l[i]*r[j]);
            }
        }
        //return the integer results
        if(isAllInt){
            results.push_back(atoi(input.c_str()));
        }
        return results;
    }
};