题解 | #反转链表#

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

解析我放这里，点击链接直接观看

https://blog.csdn.net/Jason_from_China/article/details/137845168