求链表反转求解[解决办法]一边遍历一边插入头部。C/C++ codereverse_list() p h-next h-next NULL
求链表反转
求解
[解决办法]
一边遍历一边插入头部。
- C/C++ code
reverse_list() p = h->next; h->next = NULL; while(p) { q = p->next; p->next = h; h = p; p = q; } 求链表反转
求解
[解决办法]
一边遍历一边插入头部。
reverse_list() p = h->next; h->next = NULL; while(p) { q = p->next; p->next = h; h = p; p = q; }