Python中的排序链接列表

Question

我在弄清楚如何在Python中对单链接列表进行排序时遇到了一些麻烦.我已经想出了如何创建链接列表并将数据推送到它上但是如何以排序的格式推送它(在所有数据被推到它之后不进行排序)或者只是以任何方式对其进行排序？

目的

根据用户输入创建排序的单链数字列表.程序逻辑:询问一个数字,将该数字添加到排序位置的列表中,打印列表.重复,直到他们为数字输入-1.

现行守则

#!/usr/bin/env python

class node:
    def __init__(self):
        self.data = None # contains the data
        self.next = None # contains the reference to the next node


class linked_list:
    def __init__(self):
        self.cur_node = None

    def add_node(self, data):
        new_node = node() # create a new node
        new_node.data = data
        new_node.next = self.cur_node # link the new node to the 'previous' node.
        self.cur_node = new_node #  set the current node to the new one.

    def list_print(self):
        node = self.cur_node # cant point to ll!
        while node:
            print(node.data)
            node = node.next


def main():
  ll = linked_list()

  num=int(input("Enter a num to push onto the list, -1 to stop: "))
  while num!=-1:
    data=num
    ll.add_node(data)
    num=int(input("Enter a num to push onto the list, -1 to stop: "))

  print("\n")
  ll.list_print()
main()

我真的被困在这里了.预先感谢您的任何帮助!

Answer 1

这应该这样做:

>>> class Node:
...   def __init__(self):
...     self.data = None
...     self.next = None
... 
>>> class LinkedList:
...   def __init__(self):
...     self.head = None
...   
...   def addNode(self, data):
...     curr = self.head
...     if curr is None:
...       n = Node()
...       n.data = data
...       self.head = n
...       return
...     
...     if curr.data > data:
...       n = Node()
...       n.data = data
...       n.next = curr
...       self.head = n
...       return
...     
...     while curr.next is not None:
...       if curr.next.data > data:
...         break
...       curr = curr.next
...     n = Node()
...     n.data = data
...     n.next = curr.next
...     curr.next = n
...     return
...   
...   def __str__(self):
...     data = []
...     curr = self.head
...     while curr is not None:
...       data.append(curr.data)
...       curr = curr.next
...     return "[%s]" %(', '.join(str(i) for i in data))
...   
...   def __repr__(self):
...     return self.__str__()
... 
>>> def main():
...   ll = LinkedList()
...   num = int(input("Enter a number: "))
...   while num != -1:
...     ll.addNode(num)
...     num = int(input("Enter a number: "))
...   c = ll.head
...   while c is not None:
...     print(c.data)
...     c = c.next
... 
>>> main()
Enter a number: 5
Enter a number: 3
Enter a number: 2
Enter a number: 4
Enter a number: 1
Enter a number: -1
1
2
3
4
5