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

Editor to share with you golang leetcode tips on how to achieve the minimum stack and lru, I believe that most people do not know much about it, so share this article for your reference, I hope you will learn a lot after reading this article, let's go to know it!

Design a stack that supports push, pop, top operations and retrieves the smallest elements in constant time.

Push (x)-pushes element x onto the stack.

Pop ()-removes the element at the top of the stack.

Top ()-- gets the top element of the stack.

GetMin ()-- retrieves the smallest element in the stack.

Example:

Enter:

["MinStack", "push", "getMin", "pop", "top", "getMin"]

[], [- 2], [0], [- 3], []]

Output:

[null,null,null,null,-3,null,0,-2]

Explanation:

MinStack minStack = new MinStack ()

MinStack.push (- 2)

MinStack.push (0)

MinStack.push (- 3)

MinStack.getMin ();-- > returns-3.

MinStack.pop ()

MinStack.top ();-- > returns 0.

MinStack.getMin ();-- > returns-2.

Tip:

Pop, top, and getMin operations are always called on a non-empty stack.

Ideas for solving the problem:

1, dual stack

The above is all the content of this article entitled "how to achieve minimum stack and lru with golang leetcode skills". Thank you for reading! I believe we all have a certain understanding, hope to share the content to help you, if you want to learn more knowledge, welcome to follow the industry information channel!

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.