234. Palindrome Linked List

Given a singly linked list, determine if it is a palindrome.

Example 1:

Input: 1->2
Output: false
Example 2:

Input: 1->2->2->1
Output: true
Follow up:
Could you do it in O(n) time and O(1) space?

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/palindrome-linked-list
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

//递归

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    private ListNode p1;
    private boolean recurrence(ListNode node){
        if(node != null){
            if(!recurrence(node.next)) return false;
            if(p1.val != node.val) return false;
            p1 = p1.next;
        }
        return true;
    }
    public boolean isPalindrome(ListNode head) {
        if(head==null || head.next==null) return true;
        p1 = head;
        return recurrence(head);
    }
}

//转为数组再双指针

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean isPalindrome(ListNode head) {
        if(head==null || head.next==null) return true;
        List<Integer> arr = new ArrayList<>();
        while(head!=null){
            arr.add(head.val);
            head = head.next;
        }
        int sta = 0;
        int end = arr.size()-1;
        while(sta<end){
            if(!arr.get(sta).equals(arr.get(end))) return false;
            sta++;
            end--;
        }
        return true;
    }
}

//边分割边逆置

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean isPalindrome(ListNode head) {
        if(head==null || head.next==null) return true;
        ListNode pre = head, prepre = null;
        ListNode low = head, fast = head;
        while(fast!=null && fast.next!=null){
            pre = low;
            low = low.next;
            fast = fast.next.next;
            pre.next = prepre;
            prepre = pre;
        }
        if(fast!=null) low = low.next;
        while(low!=null){
            if(pre.val != low.val) return false;
            pre = pre.next;
            low = low.next;
        }
        return true;
    }
}