栈
文章平均质量分 80
jmspan
这个作者很懒,什么都没留下…
展开
-
LeetCode 225. Implement Stack using Queues(使用队列来实现栈)
原题网址:https://leetcode.com/problems/implement-stack-using-queues/Implement the following operations of a stack using queues.push(x) -- Push element x onto stack.pop() -- Removes the element o原创 2016-04-05 03:03:30 · 654 阅读 · 0 评论 -
LeetCode 145. Binary Tree Postorder Traversal(二叉树后序遍历)
原题网址:https://leetcode.com/problems/binary-tree-postorder-traversal/Given a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1原创 2016-05-26 01:31:28 · 518 阅读 · 0 评论 -
LeetCode 22. Generate Parentheses(生成括号)
原题网址:https://leetcode.com/problems/generate-parentheses/Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a sol原创 2016-05-19 07:18:56 · 696 阅读 · 0 评论 -
LeetCode 94. Binary Tree Inorder Traversal(二叉树的中序遍历)
原题网址:https://leetcode.com/problems/binary-tree-inorder-traversal/Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1原创 2016-05-23 00:35:01 · 1001 阅读 · 0 评论 -
LeetCode 32. Longest Valid Parentheses(最长有效括号)
原题网址:https://leetcode.com/problems/longest-valid-parentheses/Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring原创 2016-05-20 10:36:43 · 498 阅读 · 0 评论 -
LeetCode 285. Inorder Successor in BST
原题网址:https://leetcode.com/problems/inorder-successor-in-bst/Given a binary search tree and a node in it, find the in-order successor of that node in the BST.Note: If the given node has no in原创 2016-04-15 00:35:29 · 1178 阅读 · 0 评论 -
LeetCode 331. Verify Preorder Serialization of a Binary Tree(校验二叉树的前序遍历序列化)
原题网址:https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/One way to serialize a binary tree is to use pre-order traversal. When we encounter a non-null node, we record t原创 2016-04-28 07:36:08 · 949 阅读 · 0 评论 -
LeetCode 316. Remove Duplicate Letters(删除重复字母)
原题网址:https://leetcode.com/problems/remove-duplicate-letters/Given a string which contains only lowercase letters, remove duplicate letters so that every letter appear once and only once. You mus原创 2016-04-23 05:51:58 · 2204 阅读 · 1 评论 -
LeetCode 188. Best Time to Buy and Sell Stock IV(股票买卖)
原题网址:https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the m原创 2016-05-02 15:03:28 · 1927 阅读 · 0 评论 -
LeetCode 84. Largest Rectangle in Histogram(最大矩形)
原题网址:https://leetcode.com/problems/largest-rectangle-in-histogram/Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest原创 2016-05-23 00:34:09 · 463 阅读 · 0 评论 -
LeetCode 71. Simplify Path(简化路径)
原题网址:https://leetcode.com/problems/simplify-path/Given an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"原创 2016-05-22 00:05:09 · 728 阅读 · 0 评论 -
LeetCode 20. Valid Parentheses(括号校验)
原题网址:https://leetcode.com/problems/valid-parentheses/Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must原创 2016-05-19 06:50:59 · 418 阅读 · 0 评论 -
LeetCode 227. Basic Calculator II(基本计算器II)
原题网址:https://leetcode.com/problems/basic-calculator-ii/Implement a basic calculator to evaluate a simple expression string.The expression string contains only non-negative integers, +, -, *,原创 2016-04-05 04:45:01 · 1816 阅读 · 0 评论 -
LeetCode 232. Implement Queue using Stacks(用栈实现队列)
原题网址:https://leetcode.com/problems/implement-queue-using-stacks/mplement the following operations of a queue using stacks.push(x) -- Push element x to the back of queue.pop() -- Removes the原创 2016-04-05 11:53:58 · 525 阅读 · 0 评论 -
LeetCode 111. Minimum Depth of Binary Tree(二叉树最小深度)
原题网址:https://leetcode.com/problems/minimum-depth-of-binary-tree/Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root nod原创 2016-05-24 00:18:53 · 992 阅读 · 0 评论 -
LeetCode 255. Verify Preorder Sequence in Binary Search Tree(检查二叉搜索树的前序遍历)
原题网址:https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/Given an array of numbers, verify whether it is the correct preorder traversal sequence of a binary search tree.原创 2016-04-09 04:44:06 · 981 阅读 · 0 评论 -
LeetCode 155. Min Stack(最小栈)
原题网址:https://leetcode.com/problems/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() -- Re原创 2016-05-26 00:56:06 · 941 阅读 · 0 评论 -
LeetCode 150. Evaluate Reverse Polish Notation(计算后缀表达式)
原题网址:https://leetcode.com/problems/evaluate-reverse-polish-notation/Evaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand m原创 2016-05-26 01:10:23 · 623 阅读 · 0 评论 -
LeetCode 144. Binary Tree Preorder Traversal(二叉树前缀遍历)
原题网址:https://leetcode.com/problems/binary-tree-preorder-traversal/Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1原创 2016-05-26 01:57:11 · 555 阅读 · 0 评论 -
LeetCode 224. Basic Calculator(基本计算器)
原题网址:https://leetcode.com/problems/basic-calculator/Implement a basic calculator to evaluate a simple expression string.The expression string may contain open ( and closing parentheses ),原创 2016-04-05 02:33:50 · 934 阅读 · 0 评论 -
LeetCode 341. Flatten Nested List Iterator(嵌套列表迭代器)
原题网址:https://leetcode.com/problems/flatten-nested-list-iterator/Given a nested list of integers, implement an iterator to flatten it.Each element is either an integer, or a list -- whose ele原创 2016-04-30 10:15:08 · 1401 阅读 · 0 评论 -
456. 132 Pattern
原题网址:https://leetcode.com/problems/132-pattern/Given a sequence of n integers a1, a2, ..., an, a 132 pattern is a subsequence ai, aj, ak such that i j k and ai < ak j. Design an algori原创 2016-11-30 04:37:54 · 1597 阅读 · 1 评论