Leetcode_234_回文链表_快慢指针

进阶就是将慢指针后面的东西反转链表，我真的不想再写反转链表了，就直接搞了。
比较有意思的点是，当长度为奇数的时候，正好让慢指针落在终点右边，需要在fast奇数次判空的时候，让slow后移。

class ListNode {
    int val;
    ListNode next;

    ListNode() {
    }

    ListNode(int val) {
        this.val = val;
    }

    ListNode(int val, ListNode next) {
        this.val = val;
        this.next = next;
    }
}

class Solution {
    public boolean isPalindrome(ListNode head) {
        if(head.next == null) {
            return true;
        }
        ListNode slow = head;
        ListNode fast = head.next;
        while(true) {
            if(fast == null) {
                slow = slow.next;
                break;
            }
            fast = fast.next;
            slow = slow.next;
            if(fast != null) {
                fast = fast.next;
            } else {
                break;
            }
        }
        fast = head;
        StringBuilder a = new StringBuilder();
        StringBuilder b = new StringBuilder();
        while(slow != null) {
            a.append(slow.val);
            b.append(fast.val);
            fast = fast.next;
            slow = slow.next;
        }
        return a.reverse().toString().equals(b.toString());
    }
}