本文共 1100 字，大约阅读时间需要 3 分钟。
输入一个连表的头结点，从尾到头反过来打印出每个结点的值。
C#语言实现：
| 1 2 3 4 5 6 7 8 9 10 11 12 | public static void PrintRev(LinkedList< int > lList) { Stack< int > stack = new Stack< int >(); foreach ( int item in lList) { stack.Push(item); } while (stack.Count > 0) { Console.WriteLine(stack.Pop()); } } |
Java语言实现：
| 1 2 3 4 5 6 7 8 9 10 | private static void printRev(LinkedList<Integer> lLink) { Stack<Integer> stack = new Stack<Integer>(); Iterator<Integer> it = lLink.iterator(); while (it.hasNext()){ stack.push(it.next()); } while (!stack.isEmpty()) { System.out.println(stack.pop()); } } |
Python语言实现：
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 | class Node( object ): """ 单链表节点 """ def __init__( self , data = None , next = None ): self .data = data self . next = next class LinkedList( object ): def __init__( self , node = None ): self .node = node def print_link_rev( self ): """ 逆序打印链表 :return: """ lst = [] node = self .node while node: lst.append(node.data) node = node. next for data in sorted (lst, reverse = True ): print (data) |