mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-17 03:01:13 +00:00
07e991d553
* ci(pre-commit): Add pep8-naming to `pre-commit` hooks (#7038) * refactor: Fix naming conventions (#7038) * Update arithmetic_analysis/lu_decomposition.py Co-authored-by: Christian Clauss <cclauss@me.com> * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * refactor(lu_decomposition): Replace `NDArray` with `ArrayLike` (#7038) * chore: Fix naming conventions in doctests (#7038) * fix: Temporarily disable project euler problem 104 (#7069) * chore: Fix naming conventions in doctests (#7038) Co-authored-by: Christian Clauss <cclauss@me.com> Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
69 lines
2.0 KiB
Python
69 lines
2.0 KiB
Python
"""
|
|
Output:
|
|
|
|
Enter a Postfix Equation (space separated) = 5 6 9 * +
|
|
Symbol | Action | Stack
|
|
-----------------------------------
|
|
5 | push(5) | 5
|
|
6 | push(6) | 5,6
|
|
9 | push(9) | 5,6,9
|
|
| pop(9) | 5,6
|
|
| pop(6) | 5
|
|
* | push(6*9) | 5,54
|
|
| pop(54) | 5
|
|
| pop(5) |
|
|
+ | push(5+54) | 59
|
|
|
|
Result = 59
|
|
"""
|
|
|
|
import operator as op
|
|
|
|
|
|
def solve(post_fix):
|
|
stack = []
|
|
div = lambda x, y: int(x / y) # noqa: E731 integer division operation
|
|
opr = {
|
|
"^": op.pow,
|
|
"*": op.mul,
|
|
"/": div,
|
|
"+": op.add,
|
|
"-": op.sub,
|
|
} # operators & their respective operation
|
|
|
|
# print table header
|
|
print("Symbol".center(8), "Action".center(12), "Stack", sep=" | ")
|
|
print("-" * (30 + len(post_fix)))
|
|
|
|
for x in post_fix:
|
|
if x.isdigit(): # if x in digit
|
|
stack.append(x) # append x to stack
|
|
# output in tabular format
|
|
print(x.rjust(8), ("push(" + x + ")").ljust(12), ",".join(stack), sep=" | ")
|
|
else:
|
|
b = stack.pop() # pop stack
|
|
# output in tabular format
|
|
print("".rjust(8), ("pop(" + b + ")").ljust(12), ",".join(stack), sep=" | ")
|
|
|
|
a = stack.pop() # pop stack
|
|
# output in tabular format
|
|
print("".rjust(8), ("pop(" + a + ")").ljust(12), ",".join(stack), sep=" | ")
|
|
|
|
stack.append(
|
|
str(opr[x](int(a), int(b)))
|
|
) # evaluate the 2 values popped from stack & push result to stack
|
|
# output in tabular format
|
|
print(
|
|
x.rjust(8),
|
|
("push(" + a + x + b + ")").ljust(12),
|
|
",".join(stack),
|
|
sep=" | ",
|
|
)
|
|
|
|
return int(stack[0])
|
|
|
|
|
|
if __name__ == "__main__":
|
|
Postfix = input("\n\nEnter a Postfix Equation (space separated) = ").split(" ")
|
|
print("\n\tResult = ", solve(Postfix))
|