problem155

README

< Previous 　　　　　　　　　　　　　　　　 Next >

155. Min Stack (Easy)

Design 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 on top of the stack.
• top() -- Get the top element.
• getMin() -- Retrieve the minimum element in the stack.

 

Example:

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.

 

Related Topics

[Stack] [Design]

Similar Questions

1. Sliding Window Maximum (Hard)
2. Max Stack (Easy)

Hints

Hint 1

Consider each node in the stack having a minimum value. (Credits to @aakarshmadhavan)

Documentation

Index

• type MinStack
  • func Constructor() MinStack
  • func (this *MinStack) GetMin() int
  • func (this *MinStack) Pop()
  • func (this *MinStack) Push(x int)
  • func (this *MinStack) Top() int

Types

type MinStack

type MinStack struct {
	// contains filtered or unexported fields
}

func Constructor

func Constructor() MinStack

* initialize your data structure here.

func (*MinStack) GetMin

func (this *MinStack) GetMin() int

func (*MinStack) Pop

func (this *MinStack) Pop()

func (*MinStack) Push

func (this *MinStack) Push(x int)

func (*MinStack) Top

func (this *MinStack) Top() int