[Lintcode]12. Min Stack /[Leetcode]155. Min Stack

最新推荐文章于 2019-07-21 21:55:17 发布

原创最新推荐文章于 2019-07-21 21:55:17 发布 · 266 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

lintcode 同时被 2 个专栏收录

27 篇文章

订阅专栏

leetcode

22 篇文章

订阅专栏

本文介绍了一种名为MinStack的数据结构设计与实现方法，该结构能在常数时间内获取栈中最小元素，同时支持push、pop、top等常规操作。通过使用元组存储每个元素及其当前最小值，避免了额外的空间开销。

12. Min Stack / 155. Min Stack

本题难度: Medium/Easy
Topic: Data Structure

Description

import heapq
import collections
class MinStack:

def __init__(self):
    """
    initialize your data structure here.
    """
    self.stack = []

def push(self, x: 'int') -> 'None':
    if len(self.stack) == 0:
        self.stack.append((x,x))
        return
    if self.stack[-1][1]<x:
        self.stack.append((x,self.stack[-1][1]))
    else:
        self.stack.append((x,x))
    return 

def pop(self) -> 'None':
    return self.stack.pop()[0]
    
    

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

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

Your MinStack object will be instantiated and called as such:

obj = MinStack()

obj.push(x)

obj.pop()

param_3 = obj.top()

param_4 = obj.getMin()

我的代码

import heapq
import collections
class MinStack:

    def __init__(self):
        """
        initialize your data structure here.
        """
        self.stack = []

    def push(self, x: 'int') -> 'None':
        if len(self.stack) == 0:
            self.stack.append((x,x))
            return
        if self.stack[-1][1]<x:
            self.stack.append((x,self.stack[-1][1]))
        else:
            self.stack.append((x,x))
        return 

    def pop(self) -> 'None':
        return self.stack.pop()[0]
        
        

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

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


# Your MinStack object will be instantiated and called as such:
# obj = MinStack()
# obj.push(x)
# obj.pop()
# param_3 = obj.top()
# param_4 = obj.getMin()