题解 | #反转链表#

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 * };
 */
/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 * 
 * @param head ListNode类 
 * @return ListNode类
 */
struct ListNode* ReverseList(struct ListNode* head ) {
    // write code here
    if((head == NULL) || (head->next == NULL))
        return head;
    struct ListNode* cur = head->next;
    struct ListNode* last = head;
    last->next = NULL;
    while(cur)
    {
        struct ListNode* p = cur->next;
        cur->next = last;
        last = cur;
        cur = p;
    }
    return last;
}