链表的回文结构

class Node {
    public int data;
    public Node next;  //存储对象引用

    public Node(int data) {
        this.data = data;  //没有初始化next的引用,不知道next当前指向哪个节点
    }
}

public class SingleList {
    public Node head;//定位头节点的引用

    public void addFirst(int data) {
        Node node = new Node(data); //构造要插入的对象
        if(this.head == null) {
            this.head = node;
            return;
        } else {
            node.next = this.head;
            this.head = node;
        }
    }

    public void show(){
        Node cur=this.head;   //从头开始
        while(cur!=null){
            System.out.print(cur.data+" ");
            cur=cur.next;
        }
        System.out.println();
    }

    public boolean chkPalindrome() {
if(this.head==null){
    return false;
}
if(this.head.next==null){  //只有1个节点的时候，也是回文
    return true;
}
        //1、找到中间位置
        Node fast = this.head;
        Node slow = this.head;

        while (fast != null && fast.next != null) {
            fast = fast.next.next;
            slow = slow.next;
        }
        //slow就是中间位置。开始进行第2步

        //2、进行反转
            Node cur = slow.next;
        while(cur!=null) {
            Node curNext=cur.next;
            cur.next=slow;
            slow=cur;
            cur=curNext;
        }

        //3、开始判断
        while(this.head!=slow){
            if(this.head.data!=slow.data){
              return false;
        }
            if(this.head.next==slow){   //偶数情况下
                return true;
            }
            this.head=this.head.next;
            slow=slow.next;
}
        return true;
    }
}

public class TestDemo {
    public static void main(String[] args) {
SingleList singleList=new SingleList();
        singleList.addFirst(2);
        singleList.addFirst(5);
        singleList.addFirst(4);
        singleList.addFirst(5);
        singleList.addFirst(2);
        singleList.show();
        System.out.println(singleList.chkPalindrome());

    }
}