package
0.0.0-20241220224003-b7cf03a90b2b
Repository: https://github.com/szhou12/leetcode-go.git
Documentation: pkg.go.dev
# README
150. Evaluate Reverse Polish Notation
Solution idea
Stack
规则：遇到数字则入栈；遇到算符则取出栈顶两个数字进行计算，并将结果压入栈中
Time complexity = $O(n)$