单向链表>单向循环链表

#include <stdio.h>
#include <iostream>
#include <stdlib.h>

using namespace std;

struct Person{
    int age;
    struct Person *next;
};
Person *CrtHeadNode(){
    Person *head ,*tmp;
    head = tmp = NULL;
    Person *p=NULL;
    int n;
    cout<<"Node Number:"<<endl;
    cin>>n;
    for(int i = 0;i<n;i++){
        tmp = new Person;//(Person*)(malloc(sizeof(Person)));
        cout<<"Age:" <<endl;
        cin >>tmp->age;
        tmp->next=NULL;
        if(head){
            tmp->next = head;
            head  = tmp ;
        }else{

            p = head = tmp;
        }
    }
    p->next = head;
    return head;
}

Person *CrtTailNode(){
    Person *head,*tail,*tmp;
    int n;
    cout<<"Node Number:"<<endl;
    cin>>n;
    head = tail = tmp = NULL;
    for(int i = 0;i<n;i++){
        tmp = new Person;//(Person*)(malloc(sizeof(Person)));
        cout<<"Age:" <<endl;
        cin >>tmp->age;
        if(head){
            while(tail->next!=head){
                tail = tail->next;
            }
            tail->next = tmp;
            tail = tmp;
            tmp->next=head;
    //        head = tail->next;
        }else{
            head = tail = tmp;
            tmp->next=head;
    //        head = tail->next;
        }
    }
    return head;
}
Person *FindNode(Person *head,int age){
    Person* tmp;
    tmp = NULL;
    tmp = head;
    do{
        if(tmp->age == age){
            break;
        }
        tmp  = tmp->next;
    }while(tmp!=head);
    if(tmp==head){
        return NULL;
    }
    
    /*
    while(tmp!=NULL){
        if(tmp->age ==age){
            break;
        }
        tmp = tmp->next;
    }
    if(tmp==NULL){
        return NULL;
    }*/
    return tmp;
    
}
int DelNode(Person *head,int age){
    Person *tmp;
    tmp = NULL;
    tmp = head;
    do{
        if(tmp->next->age == age){
            break;
        }
        tmp  = tmp->next;
    }while(tmp!=head);
    if(tmp==head){
        return 1;
    }
    /*
    while(tmp->next!=NULL){
        if(tmp->next->age==age){
            break;
        }
        tmp = tmp->next;
    }
    if(tmp->next==NULL){
        cout<<"DEL NOT FIND!"<<endl;;
        return 1;
    }*/
    else{
        Person *find = NULL;
        find  = tmp->next;
        tmp->next = find->next;
        free(find);
//        delete find;
    }
    return 0;

}

void show(Person *head){

/*    if(head==NULL){
        cout<<"Empty"<<endl;
    }
    */
    
    Person *p;
    p = head->next;
    cout<<head->age<<endl;
    while(p!=head){
        cout<<p->age<<endl;
        p = p->next;
    }
/*
    Person *p = head;
    do{
        cout<<p->age<<endl;
        p = p->next;
    }while(p!=head);*/
}
int main(){
    Person *p;
    Person *find;
    p = CrtHeadNode();
//    p = CrtTailNode();
//    MakeEmptyNode(p);
    
    
    find = FindNode(p,10);
    if(find==NULL){
        cout<<"Not find"<<endl;
    }else{
        cout<<"FindNode is:"<<find->age<<endl;
    }
    
    int n=    DelNode(p,10);
    if(!n){
        cout<<"del success!"<<endl;
    }/*
    find = FindNode(p,10);
    if(find==NULL){
        cout<<"Not find"<<endl;
    }else{
        cout<<"FindNode is:"<<find->age<<endl;
    }*/
    show(p);
    return 0;
}