题解 | #反转链表#

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