Shulou(Shulou.com)06/01 Report--

This article mainly introduces the golang brush leetcode skills how to achieve the maximum value of the queue, has a certain reference value, interested friends can refer to, I hope you have a lot of gains after reading this article, the following let Xiaobian take you to understand.

Define a queue and implement the max_value function to get the maximum value in the queue, requiring that the functions max_value, push_back, and pop_front all have O(1) time complexity.

If the queue is empty, pop_front and max_value need to return-1

Example 1:

Input:

["MaxQueue","push_back","push_back","max_value","pop_front","max_value"]

[[],[1],[2],[],[],[]]

Output: [null, 2,1,2]

Example 2:

Input:

["MaxQueue","pop_front","max_value"]

[[],[],[]]

Output: [null,-1,-1]

Limitations:

1

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.