力扣刷题打卡 ---- 234.回文链表

1.题目描述

请判断一个链表是否为回文链表。

2.题目示例

3.思路及代码

• 思路一：暴力思路，先遍历，然后加入数组，最后双指针判断即可，效率很低
• 代码：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean isPalindrome(ListNode head) {
        ListNode cur = head;
        int count = 0;
        while(cur != null){
            count++;
            cur = cur.next;
        }
        int[] arr = new int[count];
        int index = 0;
        while(head != null){
            arr[index++] = head.val;
            head = head.next;
        }

        int left = 0;
        int right = arr.length - 1;
        while(left < right){
            if(arr[left] != arr[right]){
                return false;
            }
            left++;
            right--;
        }
        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 slow = head;
        ListNode fast = head;
        while(fast.next != null && fast.next.next != null){
            slow = slow.next;
            fast = fast.next.next;
        }

        ListNode cur = null;
        ListNode pre = null;
        if(fast == null){
            cur = slow;
        }else{
            cur = slow.next;
        }
        //反转
        while(cur != null){
            ListNode next = cur.next;
            cur.next = pre;
            pre = cur;
            cur = next;
        }
        //对比
        while(pre != null){
            if(pre.val != head.val){
                return false;
            }
            pre = pre.next;
            head = head.next;
        }
        
        return true;
    }
}

• 运行结果：