下列代码的功能是返回带头结点的单链表L的逆转链表。

List Reverse( List L )
{Position Old_head, New_head, Temp;New_head = NULL;Old_head = L->Next;while ( Old_head )  {Temp = Old_head->Next;old_head->next=new_head;    //空1  New_head = Old_head;  Old_head = Temp; }L=new_head;    //空2
;return L;
}

因为没有很理解题目意思遂在网站上查找了关于逆转链表的博客

题目答案：https://blog.csdn.net/Ontheroad_/article/details/72886974 写了顺序表和链表的答案

过程详解：https://blog.csdn.net/qq_26565435/article/details/82898161?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522159159073919724811808261%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=159159073919724811808261&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~sobaiduend~default-3-82898161.first_rank_ecpm_v3_pc_rank_v3&utm_term=%E9%80%86%E8%BD%AC%E9%93%BE%E8%A1%A8