- 博客(2)
- 收藏
- 关注
原创 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 91
原创 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 107
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人