import java.util.ArrayList;
import java.util.Stack;
public class 从尾到头打印链表 {
public static void main(String[] args) {
ListNode l1=new ListNode(2);
l1.add(3);
l1.add(5);
int[] l2=printListReversingly(l1);
l1.print();
System.out.println();
for(int x:l2){
System.out.print(x+” “);
}
}
//利用栈stack
public static int[] printListReversingly(ListNode head){
Stack<Integer> stack=new Stack<>();
while(head!=null){
stack.push(head.val);
head=head.next;
}
ArrayList<Integer> list=new ArrayList<Integer>();
while(!stack.isEmpty()){
list.add(stack.pop());
}
int[] d = new int[list.size()];
for(int i = 0;i<list.size();i++){
d[i] = list.get(i);
}
return d;
}
}