206. 反转链表

题目描述

反转一个单链表。

题解

public class SolutionFor206 {

    public ListNode reverseList(ListNode head) {
        if(head == null)
            return null;
        ListNode prev = null;
        ListNode cur = head;
        ListNode next = head.next;

        while (next != null){
            cur.next = prev;
            prev = cur;
            cur = next;
            next = cur.next;
        }
        cur.next = prev;
        return cur;
    }

}