题解 | #判断一个链表是否为回文结构#

import java.util.*;

/*
 * public class ListNode {
 *   int val;
 *   ListNode next = null;
 *   public ListNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param head ListNode类 the head
     * @return bool布尔型
     */
  	//反转链表
    public ListNode reverse(ListNode head){
        ListNode pre = null;
        while(head != null){
            ListNode next = head.next;
            head.next = pre;
            pre = head;
            head = next; 
        }
        return pre;
    }
    public boolean isPail (ListNode head) {
        // write code here
        ListNode fast,slow;
        fast = slow = head;
        while(fast != null && fast.next != null){
            fast = fast.next.next;
            slow = slow.next;
        }
        ListNode p = reverse(slow);
        while(p != null){
            if(p.val != head.val)
                return false;
            p = p.next;
            head = head.next;
        }
        return true;
    }
}

1. 使用快慢指针，找到链表中点
2. 将后半段链表反转
3. 逐个比较前半段和后半段链表