LeetCode234回文连表

if (head == null ){
            return true;
        }
        if (head.next == null){
            return true;
        }
        Stack<ListNode> stack = new Stack<>();
        ListNode slow = head;
        ListNode fast = head;
        while (fast != null) {
            stack.push(slow);
            if (fast.next == null){
                 break;
            }
            fast = fast.next.next;
            slow=slow.next;
        }
        
        while (slow != null){
            int var = slow.val;
            ListNode tmp = stack.pop();
            if (var != tmp.val){
                return false;
            }
            slow = slow.next;
        }
        return true;

public boolean isPalindrome(ListNode head) {
        if (head == null || head.next == null)
            return true;

        ListNode slow = head; // 一块一慢两个指针，为了找到需要翻转的半条链表的起点。遍历半个链表
        ListNode fast = head;
        ListNode pre = null; // 用于辅助翻转前半条链表
        while (fast != null && fast.next != null) {
            ListNode cur = slow;
            slow = slow.next;
            fast = fast.next.next;
            cur.next = pre;
            pre = cur;
        }
        if (fast != null) slow = slow.next;
        while (pre != null) { // 两个半长链表的比较 遍历两个 半长链表
            if (pre.val != slow.val)
                return false;
            slow = slow.next;
            pre = pre.next;
        }
        return true;
    }