stack
文章平均质量分 83
jan_deng
这个作者很懒,什么都没留下…
展开
-
LeetCode OJ 496. Next Greater Element I
LeetCode OJ 513. Find Bottom Left Tree ValueDescriptionYou are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nu原创 2017-03-23 20:03:00 · 240 阅读 · 0 评论 -
LeetCode OJ 503. Next Greater Element II
LeetCode OJ 503. Next Greater Element IIDescriptionGiven a circular array (the next element of the last element is the first element of the array), print the Next Greater Number for every element. The原创 2017-03-24 13:02:26 · 217 阅读 · 0 评论 -
LeetCode OJ 155. Min Stack
LeetCode OJ 155. Min StackDescriptionDesign 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 o原创 2017-04-02 15:41:39 · 273 阅读 · 0 评论