栈
i-Blue
抱平常心走平常路
展开
-
20. Valid Parentheses--合法的括号组合(使用stack)
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. The brackets must close in the correct order, "()" and "()[]{}" are all vali原创 2016-11-23 14:39:25 · 313 阅读 · 0 评论 -
Min Stack_栈_保存最小值(用数组)
题目:Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- G原创 2016-12-09 20:25:18 · 359 阅读 · 0 评论 -
二叉树的前序、中序、后序遍历—迭代方法
leetcode上的相关题目: 前序:https://leetcode.com/problems/binary-tree-preorder-traversal/?tab=Description 中序:https://leetcode.com/problems/binary-tree-inorder-traversal/?tab=Description 后序:https://leetcode.原创 2017-02-25 11:35:46 · 9829 阅读 · 0 评论