算法-单链表遍历及反转(java)

单链表遍历及反转

package org.example.leecode;

import lombok.Data;

public class LinkedNodeTest {
    public static void main(String[] args) {

        LinkedNode head = new LinkedNode();
        head.setData(-1);
        head.setNext(null);

        LinkedNode pre = new LinkedNode();
        head = pre;
        for (int i = 0; i < 10; i++) {
            LinkedNode temp = new LinkedNode();
            temp.setData(i);
            // 尾插法，从头遍历时，
            pre.setNext(temp);
            pre = pre.getNext();

            // 头插法
//            temp.setNext(head.getNext());
//            head.setNext(temp);
        }
        pre.setNext(null);

        // 从表头遍历到表尾
        LinkedNode temp = new LinkedNode();
        temp = head;
        while (temp.getNext() != null) {
            temp = temp.getNext();
            System.out.print(temp.getData()+",");
        }

        LinkedNode elem