[数据结构与算法]leetcode234回文链表

请判断一个链表是否为回文链表。
示例 1:
输入: 1->2
输出: false
示例 2:
输入: 1->2->2->1
输出: true

class Solution {
    public boolean isPalindrome(ListNode head) {
        if(head == null || head.next == null) return true;
        ListNode slow = head, fast = head.next;
        while(fast != null && fast.next != null){
            slow = slow.next;
            fast =fast.next.next;
        }
        if(fast != null) slow = slow.next;
        cut(head,slow);
        return isEqual(head,reverse(slow));
    }

    private void cut(ListNode head,ListNode cutNode){
        while(head.next != cutNode){
            head = head.next;
        }
        head.next = null;
    }

    private ListNode reverse(ListNode head){
        ListNode newHead = null;
        while(head != null){
            ListNode nextNode = head.next;
            head.next = newHead;
            newHead = head;
            head = nextNode;
        }
        return newHead;
    }

    private boolean isEqual(ListNode l1,ListNode l2){
        while(l1 != null && l2 != null){
            if(l1.val != l2.val) return false;
            l1 = l1.next;
            l2 = l2.next;
        }
        return true;
    }