Files
obsidian/АиСД/Задачи/LeetCode/Evaluate Reverse Polish Notation.md
T
roma-dxunvrs c90a404c40
deploy / Pull and Restart (push) Successful in 18s
Refactor
2026-09-19 19:20:43 +03:00

22 lines
715 B
Markdown

Leetcode #150 | #Medium | [[Стек]] | [[Математика]]
## Идея
Просто стек
## Big-O
- Время ```O(N)```
- Память ```O(N)```
## Код
```Java
class Solution {
public int evalRPN(String[] tokens) {
Deque<Integer> st = new ArrayDeque<>();
for (String t : tokens) {
if (t.equals("+")) st.push(st.pop() + st.pop());
else if (t.equals("*")) st.push(st.pop() * st.pop());
else if (t.equals("-")) { int b = st.pop(), a = st.pop(); st.push(a - b); }
else if (t.equals("/")) { int b = st.pop(), a = st.pop(); st.push(a / b); }
else st.push(Integer.parseInt(t));
}
return st.pop();
}
}
```