题解 | #反转链表#

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