leetcode之Basic Calculator II

原创 2015年11月20日 00:02:06
跟Basic Calculator I差不多,只不过这次是增加了乘除,运用数据结构的基础知识做题。代码如下:
class Solution(object):
    def calculate(self, s):
        """
        :type s: str
        :rtype: int
        """
        import re
        listofnum = []
        listofsym = []
        symbol = ['*', '/', '+', '-']
        #空集
        if len(s) == 0:
            return 0
        #一个字母
        try:
            return int(s)
        except:
            #将所有项分别列出来
            s = re.sub(' ', '', s)
            n = ''
            for i in range(len(s)):
                try:
                    if s[i] in symbol:
                        listofnum.append(int(n))
                        listofsym.append(s[i])                        
                        n = ''
                    elif i == len(s) - 1:
                        n = n + s[i]
                        listofnum.append(int(n))
                    else:
                        n = n + s[i]
                except:
                    listofsym.append(s[i])
                #计算乘除
                if s[i] in ['+', '-']:
                    a = listofsym.pop()
                    if listofsym != []:
                        if listofsym[-1] in ['*', '/']:
                            listofnum1 = []
                            listofsym1 = []
                            listofnum1.append(listofnum.pop())
                            try:
                                while listofsym[-1] not in ['+', '-']:
                                    listofsym1.append(listofsym.pop())
                                    listofnum1.append(listofnum.pop())
                            except:
                                listofnum1 = listofnum1
                                listofsym1 = listofsym1
                            for i in listofsym1[::-1]:
                                a1 = listofnum1.pop()
                                b1 = listofnum1.pop()
                                if i == '*':
                                    listofnum1.append(a1 * b1)
                                else:
                                    if a1 > 0:
                                        if b1 > 0:
                                            listofnum1.append(a1 / b1)
                                        else:
                                            listofnum1.append(-(a1 / (-b1)))
                                    else:
                                        if b1 > 0:
                                            listofnum1.append(-(-a1 / b1))
                                        else:
                                            listofnum1.append(a1 / b1)
                            listofnum.append(listofnum1[0])
                    listofsym.append(a)
            #计算最后的
            if listofsym[-1] in ['*', '/']:
                listofnum1 = []
                listofsym1 = []
                listofnum1.append(listofnum.pop())
                while listofsym != []:
                    if listofsym[-1] not in ['+', '-']:
                        listofsym1.append(listofsym.pop())
                        listofnum1.append(listofnum.pop())
                    else:
                        break
                for i in listofsym1[::-1]:
                    a1 = listofnum1.pop()
                    b1 = listofnum1.pop()
                    if i == '*':
                        listofnum1.append(a1 * b1)
                    else:
                        if a1 > 0:
                            if b1 > 0:
                                listofnum1.append(a1 / b1)
                            else:
                                listofnum1.append(-(a1 / (-b1)))
                        else:
                            if b1 > 0:
                                listofnum1.append(-(-a1 / b1))
                            else:
                                listofnum1.append(a1 / b1)
                listofnum.append(listofnum1[0])
            while len(listofsym) != 0:
                a = listofnum.pop()
                b = listofnum.pop()
                try:
                    if listofsym[-1] == '-':
                        if listofsym[-2] == '-':
                            listofnum.append(a + b)
                        else:
                            listofnum.append(b - a)
                    else:
                        if listofsym[-2] == '-':
                            listofnum.append(b - a)
                        else:
                            listofnum.append(b + a)
                    listofsym.pop()
                except:
                    if listofsym[-1] == '-':
                        return b - a
                    else:
                        return a + b
            return listofnum[0]

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

【leetcode】String——Basic Calculator II (227)

题目: Implement a basic calculator to evaluate a simple expression string. The expression string...

[LeetCode]Basic Calculator II

解题思路: 1,就是要写个简单的计算器呗 2,先把所有的 space去掉, 实现nonSpace方法; 3,把所有的 operator 和 operands分开,实现简单的 splitToOpe...

Basic Calculator II -- leetcode

Implement a basic calculator to evaluate a simple expression string. The expression string contains...

LeetCode 227. Basic Calculator II

LeetCode 227. Basic Calculator II 时间复杂度O(n),空间复杂度O(1)c++

[LeetCode] Basic Calculator II

Basic Calculator II Implement a basic calculator to evaluate a simple expression string. The e...

LeetCode OJ Basic Calculator II

Basic Calculator II题目思路和这个一样:Basic Calculator I代码class ExpressionTransformation { public: string...

Leetcode 227. Basic Calculator II

题目链接:https://leetcode.com/problems/basic-calculator-ii/#/description 题目描述: mplement a basic ca...

leetcode:Basic Calculator II

leetcode 简易计算器的实现

【LeetCode】Basic Calculator II

【LeetCode】Basic Calculator II Implement a basic calculator to evaluate a simple expression string. ...

Basic Calculator II - LeetCode 227

题目描述: Implement a basic calculator to evaluate a simple expression string. The expression string c...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)