/**
* public class ListNode {
* int val;
* ListNode next = null;
*
* ListNode(int val) {
* this.val = val;
* }
* }
*
*/
import java.util.ArrayList;
import java.util.List;
import java.util.Stack;
public class Solution {
public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
Stack<Integer> stack =new Stack<>();
ArrayList<Integer> result=new ArrayList<>();
while(listNode!=null){
stack.push(listNode.val);
listNode=listNode.next;
}
while(!stack.isEmpty()){
result.add(stack.pop());
}
return result; //链表为空时 result也为空
}
}
剑指offer 从尾到头打印链表
最新推荐文章于 2024-01-24 22:27:37 发布