链表的回文结构

判断一个链表是否是回文结构，返回 true 或者 false
思路是快慢指针和反转链表（后半部分），再进行比较
题目来源：牛客网

import java.util.*;

/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/
public class PalindromeList {
    public static ListNode reverseList(ListNode head){
        ListNode prev = null;
        ListNode next = null;
        ListNode cur = head;
        while(cur != null){
            next = cur.next;
            cur.next = prev;
            prev = cur;
            cur = next;
        }
        return prev;
    }
    public static boolean chkPalindrome(ListNode head){
        ListNode slow = head;
        ListNode fast = head;
        while(fast != null && fast.next != null){
            slow = slow.next;
            fast = fast.next.next;
        }
        //反转后半部分链表，比如 1 -> 2 -> 1 -> null   反转后为  1 -> null <- 2 <- 1
        ListNode prev = reverseList(slow);
        //定义两个结点记录头，和尾，开始从两端比较
        ListNode pHead = head;
        ListNode tail = prev;
        boolean flag = true;
        while(tail != null){
            if(pHead.val != tail.val){
                flag = false;
                break;
            }
            pHead = pHead.next;
            tail = tail.next;
        }
        //比较完以后还原原来的链表结构，因为比较的过程改变了原有链表
        reverseList(prev);
        //返回结果
        return flag;
    }
}


//可以对照上面的代码看下面的代码
//来源： LeetCode

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean isPalindrome(ListNode head) {
        ListNode slow = head;
        ListNode fast = head;
        while(fast != null && fast.next != null){
            slow = slow.next;
            fast = fast.next.next;
        }
        //反转链表的的后半部分
        ListNode current = slow;
        ListNode prev = null;
        while(current != null){
            ListNode next = current.next;
            current.next = prev;
            prev = current;
            current = next;
        }
        //定义两个结点记录头，和尾，开始从两端比较
        ListNode pHead = head;
        ListNode last = prev;
        boolean flag = true;
        while(last != null){
            if(pHead.val != last.val){
                flag = false;
                break;
            }
            pHead = pHead.next;
            last = last.next;
        }
        return flag;
    }
}