1.单链表逆序
typedef struct node
{
int data;
struct node *next;
}NODE;
NODE *reverse(NODE * head)
{
NODE *p = head;
NODE *q = head->next;
NODE *r = NULL;
while(q)
{
r = q->next;
q->next = p;
head->next = r;
p = q;
q = r;
}
return p;
}