题解 | 反转链表

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