import java.util.ArrayList;
import java.util.Stack;
public class Solution {
public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
Stack<Integer> resstack=new Stack<>();
while (listNode!=null){
resstack.push(listNode.val);
listNode=listNode.next;
}
ArrayList<Integer> reslist=new ArrayList<>();
while (!resstack.isEmpty()){
reslist.add(resstack.pop());
}
return reslist;
}
}
链表逆序输出
最新推荐文章于 2022-01-25 14:54:33 发布