【leetcode?python】 225. Implement Stack using Queues

标签：structure   while   python   initial   bsp   先进后出   type   stack   self   

#栈是先进后出

#队列先进先出

class Stack(object):
    def __init__(self):
        """
        initialize your data structure here.
        """
        self.inQueue=[]
        self.outQueue=[]

    def push(self, x):
        """
        :type x: int
        :rtype: nothing
        """
        self.inQueue.append(x)
        
        

    def pop(self):
        """
        :rtype: nothing
        """
        i=0
        while i<len(self.inQueue)-1:
            self.outQueue.append(self.inQueue[i])
            i+=1
        self.inQueue=self.outQueue
        self.outQueue=[]
       
       
        
    def top(self):
        """
        :rtype: int
        """
        tmpQueue=self.inQueue
        i=0;
        while i<(len(self.inQueue)-1):
            self.outQueue.append(self.inQueue[i])
            i+=1
        
        res=[i for i in self.inQueue if i not in self.outQueue]
        self.outQueue=[]
        return res[0]
        

    def empty(self):
        """
        :rtype: bool
        """
        return True if (len(self.inQueue))==0 else False
       

【leetcode?python】 225. Implement Stack using Queues

标签：structure   while   python   initial   bsp   先进后出   type   stack   self   

原文地址：http://www.cnblogs.com/kwangeline/p/6016918.html