LeetCode 206. 反转链表 java

示例 :

输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL

JAVA 代码：

class Solution {
    public ListNode reverseList(ListNode head) {
        if (head == null || head.next == null) {
			return head;
		}
		ListNode headNode = reverseList(head.next);
		head.next.next = head;
		head.next = null;
		return headNode;
    }
}