力扣 234. 回文链表

给你一个单链表的头节点 head ，请你判断该链表是否为

回文链表

。如果是，返回 true ；否则，返回 false 。

示例 1：

输入：head = [1,2,2,1]
输出：true

示例 2：

输入：head = [1,2]
输出：false

提示：

• 链表中节点数目在范围[1, 105] 内
• 0 <= Node.val <= 9

进阶：你能否用 O(n) 时间复杂度和 O(1) 空间复杂度解决此题？

/**
 * Definition for singly-linked list.
 * public 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 == null) {
            return true;
        }
        ListNode newHead = new ListNode(head.val);
        ListNode current = newHead;
        ListNode originalCurrent = head.next;
        // 遍历原始链表，并复制节点
        while (originalCurrent != null) {
            current.next = new ListNode(originalCurrent.val);
            current = current.next;
            originalCurrent = originalCurrent.next;
        }

        newHead=changeutil(newHead,null);
        boolean flag=true;
        while(newHead!=null){
            if(newHead.val!=head.val){
                flag=false;
                break;
            }
            newHead=newHead.next;
            head=head.next;
        }
        return flag;
    }
    public ListNode changeutil(ListNode current,ListNode previous){
        if(current==null){
            return previous;
        }
        ListNode nextnode=current.next;
        current.next=previous;
        return changeutil(nextnode,current);
    }
}