leetcode 127. Word Ladder

努利！奋斗！

于 2022-07-05 04:30:39 发布

阅读量171

点赞数

分类专栏： Leetcode 其他类型题目文章标签： leetcode 算法数据结构

本文链接：https://blog.csdn.net/qq_37821701/article/details/125611904

版权

Leetcode 其他类型题目专栏收录该内容

106 篇文章 1 订阅

订阅专栏

题目

在这里插入图片描述

解法：stack

题目跟calculator很相似，用stack即可解决
有两个注意点：

python的isdigit函数对于负数情况需要单独判断
这边的负数出发也要注意，//操作是向下取整，int是直接去掉小数部分

class Solution:
    def evalRPN(self, tokens: List[str]) -> int:
        stack = []
        for op in tokens:
            # isdigit function does not work for negative number
            if op.isdigit() or op[1:].isdigit():
                # print(op)
                stack.append(int(op))
            else:
                second_num = stack.pop()
                first_num = stack.pop()
                if op == '+':
                    stack.append(first_num+second_num)
                elif op == '-':
                    stack.append(first_num-second_num)
                elif op == '*':
                    stack.append(first_num*second_num)
                elif op == '/':
                    # need to do division first and convert to int, // will do rounds down
                    # for example -1//2 = -1 rather than 0
                    # int operation cuts the float part and remain the int part
                    stack.append(int(first_num / second_num))
        # print(stack)
        return stack[0]