链表题基础技巧ListNode

链表题技巧

这里我们聊一下链表题的2个技巧，常用的反转链表、链表折半。在很多题里能用到，这里有一道《回文链表》的题，用到了这两个技巧。

反转链表

反转链表可以用O(n)的时间，O(1)的空间，拿到倒序的数据

	private ListNode reverseList(ListNode head) {
    
    
        ListNode prev = null;
        ListNode curr = head;
        while (curr != null) {
    
    
            ListNode nextTemp = curr.next;
            curr.next = prev;
            prev = curr;
            curr = nextTemp;
        }
        return prev;
    }

链表折半点

获取链表中点，可以用来判断回文，也用到了快慢指针的概念

	private ListNode endOfFirstHalf(ListNode head) {
    
    
        if (head == null) return null; 
        ListNode fast = head;
        ListNode slow = head;
        while (fast.next != null && fast.next.next != null) {
    
    
            fast = fast.next.next;
            slow = slow.next;
        }
        return slow;
    }

题目：回文链表

编写一个函数，检查输入的链表是否是回文的。

输入： 1->2
输出： false

输入： 1->2->2->1
输出： 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) {
    
    
            return true;
        }

        // 找到前半部分链表的尾节点并反转后半部分链表
        ListNode firstHalfEnd = endOfFirstHalf(head);
        ListNode secondHalfStart = reverseList(firstHalfEnd.next);

        // 判断是否回文
        ListNode p1 = head;
        ListNode p2 = secondHalfStart;
        boolean result = true;
        while (result && p2 != null) {
    
    
            if (p1.val != p2.val) {
    
    
                result = false;
            }
            p1 = p1.next;
            p2 = p2.next;
        }        

        // 还原链表并返回结果, 可省略
        firstHalfEnd.next = reverseList(secondHalfStart);
        return result;
    }

    private ListNode reverseList(ListNode head) {
    
    
        ListNode prev = null;
        ListNode curr = head;
        while (curr != null) {
    
    
            ListNode nextTemp = curr.next;
            curr.next = prev;
            prev = curr;
            curr = nextTemp;
        }
        return prev;
    }

    private ListNode endOfFirstHalf(ListNode head) {
    
    
        if (head == null) return null; 
        ListNode fast = head;
        ListNode slow = head;
        while (fast.next != null && fast.next.next != null) {
    
    
            fast = fast.next.next;
            slow = slow.next;
        }
        return slow;
    }
}