/**
* public class ListNode {
* int val;
* ListNode next = null;
*
* ListNode(int val) {
* this.val = val;
* }
* }
*
*/
import java.util.ArrayList;
import java.util.Collections;
public class Solution {
public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
ArrayList<Integer> res = new ArrayList<>();
while(listNode!=null)
{
Integer in = listNode.val;
listNode =listNode.next;
res.add(in);
}
Collections.reverse(res);
return res;
}
}
剑指offer从尾到头打印链表
最新推荐文章于 2022-06-23 19:13:38 发布