从尾到头打印链表

import java.util.ArrayList;
import java.util.List;

class ListNode {
         int val;
         ListNode next = null;

         ListNode(int val) {
             this.val = val;
         }
     }
class Solution {
    public ListNode head;
    public ListNode val;

    public Solution() {
        this.head = null;
    }

    public void addFirst(int data) {
        ListNode node = new ListNode(data);
        if (this.head == null) {
            head = node;
        } else {
            node.next = head;
            head = node;
        }
    }
    public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
        ArrayList<Integer> s=new ArrayList<Integer>();
        while(listNode!=null){
            s.add(0,listNode.val);
            listNode=listNode.next;
        }
        return s;
    }
}
public class test{
    public static void main(String[] args) {

        Solution t=new Solution();
        t.addFirst(1);
        t.addFirst(2);
        t.addFirst(3);
        t.addFirst(4);
        t.addFirst(5);
        System.out.println(t.printListFromTailToHead(t.head));
    }
}

 

来源：CSDN

作者：小朋友哈哈

链接：https://blog.csdn.net/qq_45443879/article/details/103548559