近期在力扣上刷tree系列的时候,发现很多solution都采用Deque接口来实现栈,在此转载一篇文章记录一下Deque和Stack的区别和来源。
原文:Java中用Deque接口代替Stack接口完成栈功能
作者: Hazza Cheng
示例代码:145. 二叉树的后序遍历迭代实现
class Solution {
public List<Integer> postorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<Integer>();
if (root == null) {
return res;
}
Deque<TreeNode> stack = new LinkedList<TreeNode>();
TreeNode prev = null;
while (root != null || !stack.isEmpty()) {
while (root != null) {
stack.push(root);
root = root.left;
}
root = stack.pop();
if (root.right == null || root.right == prev) {
res.add(root.val);
prev = root;
root = null;
} else {
stack.push(root);
root = root.right;
}
}
return res;
}
}