题解 | #反转链表#

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

    if (!head)
        return head;
    while (cur)
    {
        cur->next = pre;
        pre = cur;
        cur = cur_next;
        cur_next = cur->next;
    }
    return pre;
}