《剑指offer》005-从尾到头打印链表

显式用栈和非显式用栈（递归）代码：

import java.util.Stack;
class ListNode{
    int val;
    ListNode next;
    ListNode(int i){
        this.val = i;
    }
}
public class ReversePrint{
    public static void main(String[] args){
        ReversePrint r = new ReversePrint();
        ListNode node = new ListNode(0);
        ListNode tmp = node;
        for(int i = 1; i < 100; i++){
            ListNode now = new ListNode(i);
            tmp.next = now;
            tmp = now;
        }
        tmp.next = null;
        r.reversePrint(node);
        System.out.println();
        r.reversePrint2(node);
    }
    private void reversePrint(ListNode node){
        Stack<ListNode> s = new Stack<ListNode>();
        ListNode tmp = node;
        while(tmp != null){
            s.push(tmp);
            tmp = tmp.next;
        }
        while(!s.isEmpty()){
            System.out.print(s.pop().val + " ");
        }
    }
    private void reversePrint2(ListNode node){
        if(node != null){
            if(node.next != null){
                reversePrint2(node.next);
            }
            System.out.print(node.val + " ");
        }
    }
}

当链表非常长时，就会导致函数调用的层级很深，可能导致函数调用栈溢出。