python环形队列_循环队列Python

I am trying to make a circular queue in Python so that when the last element in the array is reached to points back to the head. I am working on the enqueue method and I am having some issues. I am trying to have an array of size 4 and I am able to enqueue values up to the 4th spot, but when it executes the elif statement I receive this error.

TypeError: unsupported operand type(s) for +: 'Node' and 'int'

Any thoughts?

class Node(object):

def __init__(self, item = None):

self.item = [None] * 4

self.next = None

self.previous = None

class CircularQueue(object):

def __init__(self):

self.length = 0

self.head = None

self.tail = None

def enqueue(self, x):

newNode = Node(x)

newNode.next = None

if self.head == None:

self.head = newNode

self.tail = newNode

elif self.length < 4:

self.tail.next = newNode

newNode.previous = self.tail

self.tail = newNode

else:

self.tail = (self.tail + 1) % 4

self.length += 1

def dequeue(self):

if self.count == 0:

print ("The Queue is empty!")

self.count -= 1

return self.item.pop()

def size(self):

return self.length

解决方案

If you don't have to implement this yourself, you can use the standard library deque

from collections import deque

circular_queue = deque([1,2], maxlen=4)

circular_queue.append(3)

circular_queue.extend([4])

# at this point you have [1,2,3,4]

print(circular_queue.pop()) # [1,2,3] --> 4

# key step. effectively rotate the pointer

circular_queue.rotate(-1) # negative to the left. positive to the right

# at this point you have [2,3,1]

print(circular_queue.pop()) # [2,3] --> 1

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值