翻转链表(Java实现)

public class LinkedList {
    //反转链表
    class ListNode {
        int val;
        ListNode next = null;

        ListNode(int x) {
            val = x;
        }
    }

    public ListNode reverseList(ListNode head) {
        //先判断不合法情况
        if (head == null) {
            return null;
        }
        if (head.next == null) {
            return head;
        }
        //处理一般情况
        ListNode cur = head;
        ListNode pos = head;
        ListNode prev = null;
        while (cur != null) {
            pos = cur.next;
            cur.next = prev;
            prev = cur;
            cur = pos;
        }
        return head;
    }
}

在逻辑比较混乱的时候,画一个草图整理整理还是很有用的!