import java.util.ArrayList;
/*
* 输入一个链表,从尾到头打印链表每个节点的值
*/
public class Solution03 {
/*
* 思路:利用递归的思想实现
*/
ArrayList<Integer> arrayList = new ArrayList<Integer>();
public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
//递归遍历每个节点
if (listNode != null) {
this.printListFromTailToHead(listNode.next);
//获取对应节点的值添加到ArrayList数组中(add方法添加到尾部)
arrayList.add(listNode.val);
}
return arrayList;
}
public static void main(String[] args) {
ListNode listNode = new ListNode(1);
listNode.next = new ListNode(3);
listNode.next.next = new ListNode(4);
listNode.next.next.next = new ListNode(0);
Solution03 s = new Solution03();
System.out.println(s.printListFromTailToHead(listNode));
}
}
class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}
从尾到头打印链表每个节点的值(Java实现)
猜你喜欢
转载自blog.csdn.net/qq_38190057/article/details/80825285
今日推荐
周排行