struct Node
{
int val;
Node *next;
Node(int v)
{
val = v;
next = NULL;
}
};
Node* reverse(Node *head)
{
if (head == NULL)
{
return NULL;
}
Node *p = head;
Node *q = NULL;
while (p != NULL)
{
Node *temp = p->next;
p->next = q;
q = p;
p = temp;
}
return q;
}
07-29
07-29
07-29