剑指 Offer 06. 从尾到头打印链表

public class offer06 {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        ListNode head = new ListNode(1);
        head.next = new ListNode(3);
        head.next.next = new ListNode(2);
        
        int[] arr = reversePrint(head);
        for(int i:arr){
            System.out.print(i+" ");
        }
    }

    public static int[] reversePrint(ListNode head) {
        Stack<ListNode> stack = new Stack();//创建栈
        ListNode temp = head;//创建指向head的指针
        while(temp!=null){
            stack.push(temp);
            temp = temp.next;
        }
        
        int size = stack.size();
        int[] arr = new int[size];
        
        for(int i=0;i<size;i++){
            arr[i] = stack.pop().val;
        }
        return arr;
    }
}

/**
 * 单链表列表
 * @author Administrator
 *
 */
class ListNode{
    int val;
    ListNode next;
    ListNode(int x){
        val = x;
    }
}