【剑指offer-Java版】05从尾到头打印链表

从头到尾打印链表：递归实现比较简单
注意处理异常输入：如输入指针为空
处理边界条件等即可

    public class _Q05 {    public static void main(String[] args) {        ListNode head = new ListNode();        ListNode node1 = new ListNode();        ListNode node2 = new ListNode();        ListNode node3 = new ListNode();        ListNode node4 = new ListNode();        head.value = 0;  head.next = node1;        node1.value = 1; node1.next = node2;        node2.value = 2; node2.next = node3;        node3.value = 3; node3.next = node4;        node4.value = 4; node4.next = null;        printReversedList(head);    }    static void printReversedList(ListNode head){        if(head == null) return;        if(head.next != null){            printReversedList(head.next);        }        System.out.print(head.value + " ");    }    }

结点的定义：

    public class ListNode<T> {    public T value;    public ListNode<T> next;    }