设计一个算法：利用单链表原来的空间节点将一个单链表就地转置

A->B->C->D->E->F->G->NULL
定义3个指针temp1, temp2, temp3

temp1=A,temp2=B,temp3=C;
A->next = NULL;
while(temp3 != NULL)
{
temp2->next = temp1;
temp1 = temp2;
temp2 = temp3;
temp3 = temp3->next;
}

NODE *dlblx(NODE *head)
{
NODE *q,*p;
q=head->next;
p=q->next;
head->next=NULL;
while(q!=NULL)
{
q->next=head;
head=q;
q=p;
p=p->next;

}

STL源代码C++