Python实现单链表逆序，python单链逆序,#!/usr/bin/e

Python实现单链表逆序，python单链逆序,#!/usr/bin/e

#!/usr/bin/env python#-*- coding: utf-8 -*-class Node(object):    def __init__(self, data, p=0):        self.data = data        self.next = pclass Reverse(object):    def __init__(self):        self.head = 0    def initlist(self):        print "input numbers here. '!' to quit"        try:            data =  raw_input()            if data is not '!':                self.head = Node(int(data))   #指向第一个节点            p = self.head            while data != '!':                data = raw_input()                if data == '!':                    break                else:                    p.next = Node(int(data))                               p = p.next        except ValueError:            print "input error!"        finally:            print "输入结束！"    def rever(self):        self.initlist()        p = self.head   #指链表的第一个节点        nex = self.head.next        pre = Node(0)     #设置一个空节点，让链表的头节点指向它           while self.head.next != 0:            nex = self.head.next            self.head.next = pre            pre = self.head            self.head = nex        self.head.next = pre        pre = self.head        ###        #debug        print "逆序输出节点:\t",        while pre.next != 0:            print pre.data,            pre = pre.next        ###if __name__ == '__main__':    #测试数据    #data = [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15]    l = Reverse()    l.rever()