java实现——005从尾到头打印链表

 import java.util.Stack;
 public class T005 {
     public static void main(String[] args){
         Node n1 = new Node(1);
         Node n2 = new Node(2);
         Node n3 = new Node(3);
         Node n4 = new Node(4);
         Node n5 = new Node(5);
         n1.next = n2;
         n2.next = n3;
         n3.next = n4;
         n4.next = n5;
         reversePrint(n1);
     }
     public static void reversePrint(Node head){

         Stack s = new Stack();
         while(head!=null){
             s.push(head.val);
             head = head.next;
         }
         while(!s.empty()){

             System.out.println(s.lastElement());
             s.pop();
         }
     }
     public static class Node{
         int val;
         Node next;
         public Node(int val){
             this.val = val;
         }
     }
 }