Breaking News: Grepper is joining You.com. Read the official announcement!

min stack in python

Hacker Harsha answered on May 6, 2022 Popularity 4/10 Helpfulness 2/10

answer min stack in python

min stack in python

Comment

class MinStack:

    def __init__(self):
        self.stack=deque([])
        self.min=deque([])

    def push(self, val: int) -> None:
        self.stack.append(val)
        if len(self.min)==0 or val<self.min[-1]:
            self.min.append(val)
        else:
            self.min.append(self.min[-1])

    def pop(self) -> None:
        x=self.stack.pop()
        self.min.pop()
        return x

    def top(self) -> int:
        return self.stack[-1]

    def getMin(self) -> int:
        return self.min[-1]

Popularity 4/10 Helpfulness 2/10 Language python

Source: leetcode.com

Tags: min python stack

Link to this answer
Share Copy Link

Contributed on May 06 2022

Hacker Harsha

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

min stack in python

Contents

More Related Answers

min stack in python

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.