【leetcode题解】【再做一遍】【47】【M】241. Different Ways to Add Parentheses

最新推荐文章于 2022-05-20 07:14:43 发布

sscssz

最新推荐文章于 2022-05-20 07:14:43 发布

阅读量444

点赞数

分类专栏： leetcode Python 递归分治文章标签： leetcode python 递归分治

本文链接：https://blog.csdn.net/sscssz/article/details/50391669

版权

Python 同时被 3 个专栏收录

176 篇文章 0 订阅

订阅专栏

leetcode

175 篇文章 0 订阅

订阅专栏

递归

4 篇文章 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] 
  
   就是没有想出来，能怎么分治，得到所有结果。看了人家的答案，啧啧，还是得用递归。 
  
   就是利用题目里给的这个函数。 
  
   class Solution(object):
    def cal(self,a,b,op):
        if op == '-':
            return a-b
        elif op == '+':
            return a+b
        else:
            return a*b

    def diffWaysToCompute(self, input):
        s = input
        if s.isdigit():
            return [int(s)]#这句很重要
        #print s
        res = []

        for i in xrange(len(s)):
            if s[i] in '+-*':
                left = s[:i]
                right = s[i+1:]

                res_l = self.diffWaysToCompute(left)
                res_r = self.diffWaysToCompute(right)

                for j in res_l:
                    for k in res_r:
                        res.append(self.cal(j,k,s[i]))
        return res