*Reverse Linked List

题目：

Reverse a singly linked list.

代码：看不懂，我已经没救了

    public ListNode reverseList(ListNode head) {
        if (head == null) return head;
        ListNode cur = head;
        ListNode pre = null;
        while (cur.next != null){
            ListNode nextNode = cur.next;
            cur.next = pre;
            pre = cur;
            cur = nextNode;
        }
        cur.next = pre;
        return cur;
    }

reference：http://blog.welkinlan.com/2015/05/06/reverse-linked-list-leetcode-java/