LeetCode
文章平均质量分 90
staick
菜鸡一枚。
展开
-
leetcode_503.Next Greater Element II
一、题目Given 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 Next Greater Number of a number x is the first greater number to its traversing-order next in the ar原创 2021-03-06 21:55:34 · 87 阅读 · 0 评论 -
leetcode-232.Implement-Queue-using-Stacks
一、题目Implement a first in first out (FIFO) queue using only two stacks. The implemented queue should support all the functions of a normal queue (push, peek, pop, and empty).Implement the MyQueue class:void push(int x) Pushes element x to the back of t原创 2021-03-05 15:45:20 · 103 阅读 · 0 评论