Stack
文章平均质量分 77
Yingying_code
这个作者很懒,什么都没留下…
展开
-
20. Valid Parentheses*
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 va转载 2016-12-15 21:39:31 · 236 阅读 · 0 评论 -
385. Mini Parser**
Given a nested list of integers represented as a string, implement a parser to deserialize it.Each element is either an integer, or a list -- whose elements may also be integers or other lists.原创 2017-02-25 21:23:41 · 277 阅读 · 0 评论 -
332. Reconstruct Itinerary**
Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the tickets belong to a man who departs from JFK. Thus,原创 2017-01-25 23:36:43 · 351 阅读 · 0 评论 -
144. 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 \ 2 / 3return [1,2,3].Note: Recursive soluti原创 2016-12-18 10:44:16 · 200 阅读 · 0 评论 -
94. Binary Tree Inorder Traversal**
Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree [1,null,2,3], 1 \ 2 / 3return [1,3,2].Note: Recursive solu原创 2016-12-17 18:15:16 · 193 阅读 · 0 评论 -
71. Simplify Path**
Given an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"click to show corner cases.Corner Cases:Did原创 2016-12-17 23:47:32 · 205 阅读 · 0 评论 -
150. Evaluate Reverse Polish Notation**
Evaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand may be an integer or another expression.Some examples: ["2", "1",原创 2016-12-18 22:55:04 · 282 阅读 · 0 评论 -
456. 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 algorithm that takes a list of n numbers as input and check原创 2016-12-17 19:16:59 · 236 阅读 · 0 评论 -
331. 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 the node's value. If it is a null node, we record using a sentinel value such as #.原创 2016-12-17 15:48:26 · 220 阅读 · 0 评论 -
155. 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() -- Get原创 2016-12-17 00:18:27 · 199 阅读 · 0 评论 -
225. Implement Stack using Queues**
Implement the following operations of a stack using queues.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get the top element.empty() -- Return whet原创 2016-12-15 22:16:35 · 221 阅读 · 0 评论 -
232. Implement Queue using Stacks*
Implement the following operations of a queue using stacks.push(x) -- Push element x to the back of queue.pop() -- Removes the element from in front of queue.peek() -- Get the front element.empty(原创 2016-12-15 22:03:28 · 231 阅读 · 0 评论