课程设计

// 51、用循环队列实现，InitQueue(), DestroyQueue(), ClearQueue(), QueueEmpty()
#include <iostream>
#include <cstring>
using namespace std;
#define ok 1
#define test(j) cout<<j<<"*********"<<endl
typedef int status;
typedef int Datatype;
struct Node{
    Datatype value;
    struct Node *next;
};//定义节点

typedef struct{
    struct Node *head;
    struct Node *end;
    int length;
}Queue;//定义队列

status InitQueue(Queue &q){
    q.head = q.end = (Node*)malloc(sizeof(Node));
    if(q.end == NULL){
        cout<<"初始化失败"<<endl;
    }
    q.head->next = NULL;
    q.end->next = q.head;
    q.length = 0;
    return ok;
}

status InsertQueue(Queue &q,Datatype e){
    Node *p = (Node*)malloc(sizeof(Node));
    if(!p){
        cout<<"内存分配失败"<<endl;
    }
    p->value = e;
    p->next = NULL;
    q.end->next = p;
    q.end = p;
    if(q.head->next==NULL)
        q.head->next = p;
    q.end->next = q.head;
    q.length++;
    return 0;
}

status Gettop(Queue q,Datatype &a){
    a = q.head->next->value;
    return ok;
}

status OutQueue(Queue &q){
    if(q.head == q.end){
        cout<<"当前队列为空，没有元素可以删除"<<endl;
        return ok;
    }
    q.head->next = q.head->next->next;
    q.length--;
    return ok;
}

status PrintQueue(Queue q){
    Node *p;
    p = q.head->next;
    if(q.head == q.end){
            cout<<"队列为空"<<endl;
        return 0;
    }
    cout<<"当前共有"<<q.length<<"个元素"<<endl;
    cout<<"-------------队列元素为--------------"<<endl;
    while(p!=q.head){
        cout<<p->value<<" ";
        p=p->next;
    }
    cout<<endl;
    return 0;
}

status QueueEmpty(Queue q){
    if(q.head == q.end)
        return 1;
    else
        return 0;
}

status ClearQueue(Queue &q){
    struct Node *p,*t;
    q.end = q.head;
    p = q.head->next;
    q.head->next = NULL;
    while(p!=q.head){
        t = p;
        p = p->next;
        free(t);
    }
    q.length = 0;
        return ok;
}

status DestroyQueue(Queue &q){
    if(q.head!=NULL){
        q.end = q.head->next;
        free(q.head);
        q.head = q.end;
    }
    q.length = 0;
    return ok;
}

int main(){
    Queue q;
    InitQueue(q);
    Datatype a;
    int n;
    cout<<"输入队列中数的个数：";
    cin>>n;
    while(n--){//n个数进队
        a = rand()%100;//保证每次输入的数是随机数
        InsertQueue(q,a);
    }
    PrintQueue(q);
    Gettop(q,a);
    cout<<"----------当前头结点-----------"<<endl<<a<<endl;
    cout<<"输入需要删除几个节点: ";
    cin>>n;
    while(n--){
        OutQueue(q);
    }
    Gettop(q,a);
    cout<<"----------当前头结点-----------"<<endl<<a<<endl;
    PrintQueue(q);
    //判断队列是否为空
    if(QueueEmpty(q)){
        cout<<"队列为空"<<endl;
    }else{
        cout<<"队列不为空"<<endl;
    }
    cout<<"----------清空队列-----------"<<endl;
    ClearQueue(q);
    PrintQueue(q);
    if(QueueEmpty(q)){
        cout<<"队列为空"<<endl;
    }else{
        cout<<"队列不为空"<<endl;
    }
    cout<<"再次输入队列中数的个数：";
    cin>>n;
    while(n--){//n个数进队
        a = rand()%100;//保证每次输入的数是随机数
        InsertQueue(q,a);
    }
    PrintQueue(q);
    Gettop(q,a);
    cout<<"----------当前头结点-----------"<<endl<<a<<endl;;
    cout<<"-----------销毁队列-----------"<<endl;
    DestroyQueue(q);
    PrintQueue(q);
    return 0;
}





//79、利用链表的插入运算建立线性链表，然后利用链表的查找、删除、计数、输出,排序，转置等运算实现链表的查找、计数操作，并单独写成函数的形式，能在屏幕上输出操作前后的结果。

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
typedef int DataType;
typedef int Status;
typedef struct LinkList{
    DataType val;
    struct LinkList *next;
}LinkList;
using namespace std;

Status Getlist(LinkList *head,int n){//插入
    LinkList *p=(LinkList*)malloc(sizeof(LinkList));
    p=head;
    srand((int)time(0));
    for(int i=0;i<n;i++){
        LinkList *q=(LinkList*)malloc(sizeof(LinkList));
        q->val = rand()%100;// cin>>q->val;
        p->next=q;
        q->next=NULL;
        p=q;
    }
    return 0;
}

Status Count(LinkList *head) {//计数
    int sum=0;
    int x;
    cout<<"请输入要统计个数x的值：";
    cin>>x;
    LinkList *p;
    if(!head)
        return 0;
    p=head->next;
    while(p) {
        if(p->val==x) {
            sum++;
        }
        p=p->next;
    }
    cout<<"链表中X的元素的个数为："<<sum<<endl;
    return 0;
}

Status Find(LinkList *head){//查找
    LinkList *p=(LinkList*)malloc(sizeof(LinkList));
    int cnt=0,x;
    bool prime = false;
    cout<<"输入要查找的数：";
    cin>>x;
    p=head->next;
    while(p!=NULL){
        cnt++;
        if(p->val == x){
            cout<<x<<"为第"<<cnt<<"个数"<<endl;
            prime = true;
        }
        p=p->next;
    }
    if(!prime)
        cout<<"不存在所输入的数"<<endl;
    return 0;
}

Status Delete(LinkList *head){//删除指定的数
    LinkList *p=(LinkList*)malloc(sizeof(LinkList));
    p=head;
    int x;
    cout<<"输入要删除的数：";
    cin>>x;
    while(p->next!=NULL){
        if(p->next->val==x){
            p->next=p->next->next;
            continue;
        }
        if(p->next!=NULL)
            p=p->next;
    }
    return 0;
}

Status Output(LinkList *head){//输出
    LinkList *p=(LinkList*)malloc(sizeof(LinkList));
    p=head;
    while(p->next!=NULL){
        p=p->next;
        cout<<p->val<<" ";
    }
    cout<<endl;
    return 0;
}

LinkList *Transpose(LinkList *head){//转置
    LinkList *q=(LinkList*)malloc(sizeof(LinkList));
    LinkList *p=(LinkList*)malloc(sizeof(LinkList));
    if(head->next->next == NULL)
        return head;
    p=head->next;
    while(p!=NULL){
        LinkList *end=(LinkList*)malloc(sizeof(LinkList));
        end->val = p->val;
        end->next = q->next;
        q->next = end;
        p=p->next;
    }
    return q;
}

LinkList *BubbleSort( LinkList *head ){//排序
    LinkList *q=(LinkList*)malloc(sizeof(LinkList));
    LinkList *p=(LinkList*)malloc(sizeof(LinkList));
    LinkList *end=(LinkList*)malloc(sizeof(LinkList));
    int temp;
    if(head->next->next == NULL)
        return head;
    q=p=head->next;
    while(p->next!=NULL)
        p=p->next;
    end = p;
    while(end != head->next){
        for(p=head->next;p->next!=end;p=p->next){
            q = p->next;
            if(p->val>q->val){
                temp = p->val;
                p->val=q->val;
                q->val = temp;
            }
        }
        end = p;
        q = p->next;
        if(p->val>q->val){
            temp = p->val;
            p->val=q->val;
            q->val = temp;
        }
    }
    return head;
}
int main(){
    int n;
    LinkList *head=(LinkList*)malloc(sizeof(LinkList));
    cout<<"输入线性链表长度：";
    cin>>n;
    Getlist(head,n);
    Output(head);
    Count(head);
    Find(head);
    cout<<"将线性链表排序如下：";
    BubbleSort(head);
    Output(head);
    Delete(head);
    cout<<"输出最终线性链队：";
    Output(head);
    cout<<"将线性链表转置：";
    Output(Transpose(head));
    return 0;
}