3.12(反转单结点)

来源：互联网发布：sql数据库文件修复编辑：程序博客网时间：2024/06/06 18:07

#include <iostream>#include <stdlib.h>#define MAX 5using namespace std;typedef struct node{    int num;    struct node* pnext;}qnode,*pnode;pnode init(){    pnode head;    head=(pnode)malloc(sizeof(qnode));    head->pnext=NULL;    return head;}void puts(pnode head,int e){    pnode q,p;    q=head;    while(q->pnext!=NULL)    {        q=q->pnext;    }    p=(pnode)malloc(sizeof(qnode));    p->num=e;    p->pnext=NULL;    q->pnext=p;}pnode rotate(pnode head)//新建一个链表head_，把head的第一个结点放入head_，head指向下一个结点{    pnode head_,q;    head_=init();    while(head->pnext!=NULL)    {        q=head->pnext;        head->pnext=q->pnext;        q->pnext=head_->pnext;        head_->pnext=q;    }    return head_;}void traverse(pnode head){    pnode q=head->pnext;    while(q!=NULL)    {        cout<<q->num;        q=q->pnext;    }}int main(){    pnode head,head_;    head=init();    puts(head,1);    puts(head,2);    puts(head,3);    head_=rotate(head);    traverse(head_);    return 0;}

http://www.cnblogs.com/pianoid/archive/2011/05/03/reverse-a-singly-linked-list.html

0 0