栈
文章平均质量分 83
sscssz
这个作者很懒,什么都没留下…
展开
-
331. Verify Preorder Serialization of a Binary Tree【M】【16】【leetcode】
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-02-24 18:47:52 · 579 阅读 · 0 评论 -
150. Evaluate Reverse Polish Notation【M】【19】
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-05-17 13:02:43 · 399 阅读 · 0 评论 -
341. Flatten Nested List Iterator【M】【42】
Given a nested list of integers, implement an iterator to flatten it.Each element is either an integer, or a list -- whose elements may also be integers or other lists.Example 1:Given the list [原创 2016-05-31 13:26:27 · 607 阅读 · 0 评论 -
【leetcode】155. Min Stack【E】【98】
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-06-16 13:07:31 · 290 阅读 · 0 评论 -
【leetcode】394. Decode String【M】【45ms】
Given an encoded string, return it's decoded string.The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. Note thatk is原创 2016-09-06 22:50:13 · 642 阅读 · 0 评论 -
【LeetCode】496. Next Greater Element I【E】【94】
You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nums1's elements in the corresponding places of nums原创 2017-02-18 10:01:39 · 689 阅读 · 0 评论