leetcode__基本计算器II__python

解题思路:

按照两个栈的思路去导入数字和数学操作,然后根据先乘除后加减的法则,找到第一个操作数和第二操作数即可。

具体代码如下:

class Solution:
    def calculate(self, s: str) -> int:
        string = ''
        for char in s:
            if char != ' ':
                string += char
        nums = []
        operations = []
        ops = ['+', '-', '*', '/']
        tmp = 0
        for char in string:
            if char not in ops:
                tmp = tmp * 10 + int(char)
            else:
                nums.append(tmp)
                tmp = 0
                operations.append(char)
        nums.append(tmp)
        first = nums[0]
        second = '#'
        flag = '#'
        for i in range(1, len(nums)):
            if second == '#' and operations[i - 1] == '*':
                first = first * nums[i]
            if second == '#' and operations[i - 1] == '/':
                first = first // nums[i]
            if second != '#' and operations[i - 1] == '*':
                second = second * nums[i]
            if second != '#' and operations[i - 1] == '/':
                second = second // nums[i]
            if second != '#' and operations[i - 1] == '+':
                if flag == '+':
                    first += second
                    second = '#'
                    flag = '+'
                if flag == '-':
                    first -= second
                    second = '#'
                    flag = '+'
            if second != '#' and operations[i - 1] == '-':
                if flag == '+':
                    first += second
                    second = '#'
                    flag = '-'
                elif flag == '-':
                    first -= second
                    second = '#'
                    flag = '-'
            if second == '#' and operations[i - 1] == '+':
                second = nums[i]
                flag = '+'
            if second == '#' and operations[i - 1] == '-':
                second = nums[i]
                flag = '-'
        if second == '#':
            return first
        else:
            if flag == '+':
                return first + second
            else:
                return first - second
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值