Question

我正试图制作一个循环的单链表。我希望能够修改我的代码以获得一个单独喜欢的列表，但我遇到了一些麻烦。

对于我的链表，我有：

class Link (object):
  def __init__ (self, data, next = None):
    self.data = data
    self.next = next


class LinkedList(object):
  def __init__(self):
    self.first = None

  def __str__(self):
    a = "["
    current = self.first
    while current != None:
      a += str(current.data) + ', ' 
      current = current.next
    a = a[:-2] + ']'  
    return a  

  def __iter__(self):
    current = self.first
    a = []
    while current != None:
      a += [current.data]
      current = current.next
    return iter(a)

  def __len__ (self):
    current = self.first
    a = []
    while current != None:
      a += [current.data]
      current = current.next
    return len(a)

  def InsertFirst(self, item):
    NewLink = Link(item, self.first)
    self.first = NewLink

  def InsertLast(self, item):
    NewLink = Link(item)
    current = self.first

    if current == None:
      self.first = NewLink  
      return 

    while current.next != None:
      current = current.next
    current.next = NewLink 

  def Search(self, item):
    count = 0
    current = self.first
    while current != None:
      count += 1
      if current.data == item:
        return count
      else:
        pass
        current = current.next
    return -1

  def Delete(self, item):
    current = self.first
    previous = self.first

    if (current == None):
      return None

    while (current.data != item):
      if (current.next == None):
        return None
      else:
        previous = current
        current = current.next

    if (current == self.first):
      self.first = self.first.next
    else:
      previous.next = current.next

    return current

到目前为止，我的圆形清单中有：

class Link (object):
  def __init__ (self, data, next = None):
    self.data = data
    self.next = next


class CircularList(object):
  def __init__(self):
    self.first = Link(None, None)
    self.head = Link(None, self.first)

  def __str__(self):
    a = "["
    current = self.first
    while current != None:
      a += str(current.data) + ', ' 
      current = current.next
    a = a[:-2] + ']'  
    return a  

  def InsertLast(self, item):
    NewLink = Link(item)
    current = self.first

    if current == None:
      self.first = NewLink  
      return 

    while current.next != None:
      current = current.next
    current.next = Link(item)

我的问题是如何将最后一个元素链接回第一个元素，以便我可以横向？

Answer 1

循环链表的要点是跳过所有“if next is not None”逻辑。在开头，头指向自己，表明列表是空的。没有必要创建一个空的“第一” - 在一开始就做：

self.head = Link(None, None)
self.head.next = self.head

然后在其他节点之后插入一个节点，你只需执行：

def insert_after(insert_node, after_node):
    insert_node.next = after_node.next
    after_node.next = insert_node

要在列表的开头插入，请执行：

insert_after(node, head)

之前插入需要迭代才能找到“之前”节点，因为列表只是单链接的：

def insert_before(node, before_node):
    loc = head
    while loc.next is not before_node:
        loc = loc.next
    insert_after(insert_node, loc)

要在列表末尾插入，请执行以下操作：

insert_before(node, head)

要获取列表的所有元素，请执行以下操作：

current = self.head.next
while current is not self.head:
    # do something with current.data

    # advance to next element
    current = current.next

但循环列表中的实际功能是使其双重链接，因此您可以在不进行迭代的情况下插入。

Answer 2

last.next =创建时的第一个？

class Link (object):
  def __init__ (self, data, next = None):
    self.data = data
    self.next = self.first

可能不是有效的代码。但是，既然你在创作时保证会出现在列表的最后部分，那么你也可以这样做。

Answer 3

class cirlist(list):
    def __init__(self,*arg):
        super(cirlist,self).__init__(*arg)
        self.m=super(cirlist,self).__getitem__(0)
        self.Index=0
    def next(self):
        if self.Index>=super(cirlist,self).__len__()-1:
            self.m=super(cirlist,self).__getitem__(0)
        else:
            self.m=super(cirlist,self).__getitem__(self.Index+1)
        if self.Index>super(cirlist,self).__len__()-1:    
            self.Index=super(cirlist,self).index(self.m)+1
        else:
            self.Index=super(cirlist,self).index(self.m)
        return self.m

Answer 4

class Link (object):

def __init__(self, first=None, rest=None):
    self.first = first
    self.rest = rest
def get_data(self):
    return self.first
def get_next(self):
    return self.rest
def __getitem__(self, i):
    if i ==  0:
        return self.first
    get = self
    while i > 0:
        get = get.rest
        i -= 1
    if get == None:
        raise IndexError('The Sentence Index is Out of Range.')
    return get.first

class Circular_Link（object）：

def __init__(self, things):
    assert len(things) > 2
    last = Link(things[len(things)-1])
    first = Link(things[len(things)-2], last)
    index = len(things)-2
    while index > 0:
        index -= 1
        first = Link(things[index], first)
    last.rest = first
    self.circle = first
def __getitem__(self, i):
    return self.circle[i]

此示例从普通列表初始化循环列表。

Answer 5

Node类将创建一个空节点，而insert函数将通过调用Node类来创建一个节点。然后我们检查头节点，如果为空，则将新节点创建为头节点。否则，搜索节点指针为Null并插入新节点。

class clinkedlist:
  def __init__(self):
    self.head = None

  def insertat(self,data):
    new_node = Node(data)

    if self.head is None:
        self.head = new_node
    else:
        new_node.next = self.head
        self.head = new_node
  def traverse(self):
    printval = self.head
    print(printval.data)
    
    while (True):
        printval = printval.next
        print(printval.data)
        if printval == self.head:
            break


    print(printval)

帮助Python中的循环链接列表

5 个答案: