数据结构 链表/循环链表

啊。写了份链表反正以后还要学数据结构。。。
普通链表：

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cstdlib>

using namespace std;
typedef struct Node{
    int num;
    string name;
    double score;
    Node *next;
}*stNode,Node;

stNode initLink(){
    Node *l;
    l=new Node;
    if(l==NULL) cout<<"false"<<endl;
    l->next=NULL;
    return l;
}
stNode listt,start;
Node* creatLink(stNode *head){
    int num;string name;double score;
    cin>>name>>num>>score;
    Node *p;
    p =new Node;
    p->name=name;
    p->num=num;
    p->score=score;
    stNode temp =*head;
    if(*head==NULL){
        *head=p;
        p->next=NULL;
    }
    else{
        while(temp->next!=NULL){
            temp=temp->next;
        }
        temp->next=p;
    }
    return p;
}

void dispLink(stNode head){
    int t=1;
    stNode p= head;
    while(p!=NULL){
        cout<<"The student "<<t++<<":"<<endl;
        cout<<"name = "<<p->name<<endl;
        cout<<"number = "<<p->num<<endl;
        cout<<"score = "<<p->score<<endl;
        cout<<"----------------------"<<endl;
        p=p->next;
    }
}

void searchh(stNode head,int number){
    Node *p;
    p=head->next;
    while(p!=NULL&&p->num!=number){
        p=p->next;
    }
    cout<<"该的学生信息"<<endl;
    cout<<"name = "<<p->name<<endl;
    cout<<"number = "<<p->num<<endl;
    cout<<"score = "<<p->score<<endl;
    return ;
}

Node* deletee(stNode head,int number){
    Node *elem=head;
    Node *temp=NULL;
    if(elem->num==number){
        head=elem->next;
        free(elem);
    }
    else{
        while(elem!=NULL){
            temp=elem;
            elem=elem->next;
            if(elem==NULL){cout<<"不存在该学生"<<endl;}
            else if(elem->num==number){
                temp->next=elem->next;
                free(elem);
                cout<<"----------------------"<<endl;
                cout<<"删除成功！"<<endl;
                break;
            }
        }
    }
    return head;
}

int main()
{
    stNode head;
    head = initLink();//初始化头链表
    head->name="zero two";head->num=02;head->score=101;
    cout<<"请输入其他学生的信息"<<endl;
    for(int i=0;i<3;i++){
        creatLink(&head);
        cout<<"ok!"<<endl;
    }
    cout<<"----------------------"<<endl;
    int number;
    cout<<"请输出要查询学生的学号"<<endl;
    scanf("%d",&number);
    searchh(head,number);
    cout<<"----------------------"<<endl;
    cout<<"请输入要删除学生的学号"<<endl;
    scanf("%d",&number);
    deletee(head,number);
    cout<<"----------------------"<<endl;
    cout<<"请输入要删除学生的学号"<<endl;
    scanf("%d",&number);
    deletee(head,number);
    cout<<"----------------------"<<endl;
    cout<<"啊。最后剩下的人是"<<endl;
    cout<<"----------------------"<<endl;
    dispLink(head);
    return 0;
}

哎，debug了半天的循环链表：（headd默默混入其中嘤嘤嘤）

#include <iostream>
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <cstdlib>
using namespace std;
typedef struct Node{
    int num,flag;
    string name;
    struct Node *next;
}*stNode,Node;
Node *headd;
int n,e;
void initLink(){
    headd = new Node;
    if(headd==NULL) cout<<"内存分配失败"<<endl;
    else{
        headd->name="";
        headd->num=0;
        headd->next=headd;
    }
}

Node * creatLink(){
    int length,number;
    string name;
    Node *head,*ptr=NULL,*tail;
    head = new Node;
    head->name="";head->num=0;head->next=head;tail=head;head->flag=1;
    cout<<"请输入参与人数"<<endl;
    cin>>length;e=n=length;
    cout<<"请输入每个人的姓名和编号"<<endl;
    for(int i=0;i<length;i++){
        ptr=new Node;
        if(ptr==NULL) cout<<"内存分配失败"<<endl;
        cin>>name>>number;
        ptr->name=name;
        ptr->num=number;
        ptr->next=head;
        tail->next=ptr;
        tail=ptr;
    }
    return head;
}

void dispLink(Node &l){
    Node *prev = l.next;
    cout<<"所有玩家信息为："<<endl;
    cout<<"--------------------"<<endl;
    while(prev!=&l){
        prev->flag=0;
        cout<<"The name is: "<<prev->name<<endl;
        cout<<"The number is:"<<prev->num<<endl;
        cout<<"--------------------"<<endl;
        prev=prev->next;
    }
}

void findd(Node &l){
    Node *prev=l.next;
    int t=0;
    while(n!=1){
        if(prev==&l) {
            prev=l.next;continue;
        }
        if(prev->flag==1) {
            prev=prev->next;continue;
        }
        t++;
        if(t==5){
            prev->flag=1;
            n--;t=0;
            cout<<"The number "<<prev->num<<" player is out"<<endl;
        }
        prev=prev->next;
    }
}
Node * finde(Node &l){
    Node *prev=l.next;
    int i=0;
    while((prev->next!=&l)&&(i<e)){
        if(!prev->flag) break;
        prev=prev->next;i++;
    }
    return prev;
}
int main()
{
    stNode head,ans;
    initLink();
    head=creatLink();
    dispLink(*head);
    findd(*head);
    ans=finde(*head);
    cout<<"最后的胜出者是："<<endl;
    cout<<"The number is: "<<ans->num<<endl;
    cout<<"The name is: "<<ans->name<<endl;
    return 0;
}