Java数据结构-链表

public class Solution {
    private String data;
    private Solution next;

    public Solution(String data) {
        this.data = data;
    }

    public String getData() {
        return data;
    }

    public void setData(String data) {
        this.data = data;
    }

    public Solution getNext() {
        return next;
    }

    public void setNext(Solution next) {
        this.next = next;
    }

    public static void main(String[] args) {
        //初始化链表
        Solution l0 = new Solution("火车头");
        Solution l1 = new Solution("车厢1");
        Solution l2 = new Solution("车厢2");
        //设置指针
        l0.setNext(l1);
        l1.setNext(l2);
        //读取链表数据
        Solution data = l0;
        while (data!=null){
            System.out.println(data.getData());
            data = data.getNext();
        }


    }
}

/**
*    public class ListNode {
*        int val;
*        ListNode next = null;
*
*        ListNode(int val) {
*            this.val = val;
*        }
*    }
*
*/
import java.util.ArrayList;
public class Solution {
    public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
        ArrayList<Integer> arlist = new ArrayList<>();
        ListNode ln = listNode;
        while(ln != null){
            arlist.add(0,ln.val);
            ln = ln.next;
        }
        return arlist;
    }
}