求链表反转,该如何解决

求链表反转
求解

[解决办法]
一边遍历一边插入头部。

C/C++ code

reverse_list() p = h->next; h->next = NULL; while(p) {   q = p->next;   p->next = h;   h = p;   p = q; }