反转一个链表

struct node_t={    int num;    node_t *next;}node_t* reverse_list(node_t *head){    node_t *n = head;    head = NULL;    while(n)    {        node_t *m = n->next;        n->next = head;        head = n;        n = m;    }    return m;}