单链表反转

struct node{ int data; struct node *next; }Node; void reverse(Node *node){ Node *head = NULL; Node *pre = NULL; Node *cur = node; while(cur != null){ Node *tmp = cur -> next; if(tmp == NULL){ head = cur; } cur -> next = pre; pre = cur; cur = tmp; } return head; }