7月25日练习及一点作业

王小飞哇

于 2019-07-25 22:27:36 发布

阅读量107

点赞数

本文链接：https://blog.csdn.net/qq_40389529/article/details/97310461

版权

边插入边排序

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

struct node
{
    int num;
    struct node * next;
};

typedef struct node Node;
typedef struct node* Link;

void create_link(Link *head) //创建空链表
{
    *head = NULL;
}

void create_node(Link *new_node) //分配内存空间
{
    *new_node = (Link)malloc(sizeof(Node));

    if(*new_node == NULL)
    {
        printf("malloc error!\n");
        exit(-1);
    }
}

void insert_node_tail(Link *head,Link new_node) //尾插
{
    Link p;

    p = *head;

    if(*head == NULL)
    {
        *head = new_node;
        new_node -> next = NULL;
    }
    else
    {
        while(p -> next != NULL)
        {
            p = p -> next;
        }

        p -> next = new_node;
        new_node -> next = NULL;
    }
}

void display_link(Link head) //输出
{
    Link p;

    p = head;

    if(head == NULL)
    {
        printf("link is empty!\n");
        return;
    }

    while(p != NULL)
    {
        printf("%d\n",p -> num);
        p = p -> next;
    }
}

void release_link(Link *head) //释放
{
    Link p;
    
    p = *head;

    while(*head != NULL)
    {
        *head = (*head) -> next;
        free(p);
        p = *head;
    }
}

void insert_node_sort(Link *head,Link new_node) //边插入边排序
{
    Link p,q;

    p = q = *head;

    if(*head == NULL)
    {
        *head = new_node;
        new_node -> next = NULL;
    }
    else if((*head) -> num > new_node -> num)
    {
        new_node -> next = *head;
        *head = new_node;
    }
    else
    {
        while(p != NULL && p -> num < new_node -> num)
        {
            q = p;
            p = p -> next;
        }

        q -> next = new_node;
        new_node -> next = p;
    }
}

void reverse_link(Link *head) //逆序
{
    Link p1,p2,p3;

    p1 = p2 = p3 = *head;

    if(*head == NULL || (*head) -> next == NULL)
    {
        return;
    }

    p2 = p1 -> next;

    if(p2 -> next == NULL)
    {
        p2 -> next = p1;
        p1 -> next =NULL;
        *head = p2;
        return;
    }

    p3 = p2 -> next;

    while(p3 != NULL)
    {
        p2 -> next = p1;
        p1 = p2;
        p2 = p3;
        p3 = p3 -> next;
    }

    p2 -> next = p1;
    (*head) -> next = NULL;
    *head = p2;
}

int main()
{
    Link head = NULL;
    Link new_node = NULL;
    int i;

    srand((unsigned)time(NULL));

    create_link(&head); //创建空链表

    for(i = 0;i < 10;i++)
    {
        create_node(&new_node); //分配内存空间

        new_node -> num = rand()%100;

//        insert_node_tail(&head,new_node); //尾插
        insert_node_sort(&head,new_node); //边插入边排序
    }

    display_link(head); //输出

    reverse_link(&head); //逆序

    display_link(head);

    release_link(&head); //释放

    display_link(head);

    return 0;
}

带表头结点的链表

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

struct head_node
{
    int num;

    struct head_node * next;
};

typedef struct head_node Hnode;
typedef struct head_node* Hlink;

void is_malloc_ok(Hlink node)
{
    if(node == NULL)
    {
        printf("malloc error!\n");
        exit(-1);
    }
}

void create_node(Hlink *node) //分配空间
{
    *node = (Hlink)malloc(sizeof(Hnode));

    is_malloc_ok(*node);
}

void create_link(Hlink *head) //创建链表
{
    create_node(head);
    (*head) -> next = NULL;
}

void insert_node_head(Hlink head,Hlink new_node) //头插
{
    new_node -> next = head -> next;
    head -> next = new_node;
}

void display_link(Hlink head)
{
    Hlink p;

    if(head == NULL)
    {
        printf("no such link!\n");
        return;
    }

    p = head->next;

    if(p == NULL)
    {
        printf("link is empty!\n");
    }

    while(p != NULL)
    {
        printf("%d\n",p -> num);
        p = p -> next;
    }
}

void insert_node_tail(Hlink head,Hlink new_node) //尾插
{
    Hlink p;

    p = head;

    while(p -> next != NULL)
    {
        p = p -> next;
    }

    p -> next = new_node;
    new_node -> next = NULL;
}

void insert_node_midf(Hlink head,Hlink new_node,int loc) //中间插入前插
{
    Hlink p,q;

    p = q = head;

    while(p != NULL && p -> num != loc)
    {
        q = p;
        p = p -> next;
    }

    q -> next = new_node;
    new_node -> next = p;
}

void insert_node_midl(Hlink head,Hlink new_node,int loc) //中间插入后插
{
    Hlink p,q;

    p = q = head;

    while(p != NULL && q -> num != loc)
    {
        q = p;
        p = p -> next;
    }

    q -> next = new_node;
    new_node -> next = p;
}

void release_node(Hlink head) //释放链表中的结点
{
    Hlink p;
    
    p = head -> next;
    
    while(head -> next != NULL)
    {
        head -> next = (head -> next) -> next;
        free(p);
        p = head -> next;
    }

}

void release_link(Hlink *head) //释放表头
{
    Hlink p;

    release_node(*head); //释放链表中的结点
    p = *head;
    *head = (*head) -> next;
    free(p);

}

void delete_node(Hlink head,int temp)
{
    Hlink p,q;

    p = q = head->next;

    while(p != NULL && p->num != temp)
    {
        q = p;
        p = p->next;
    }
    
    if(p)
    {
        q->next = p->next;
        free(p);
    }
    else
    {
        printf("所要删除的结点不存在！");
    }
}

int main()
{
    Hlink head = NULL;
    Hlink new_node = NULL;
    int i;

    create_link(&head); //创建链表

    for(i = 0;i < 10;i++)
    {
        create_node(&new_node); //分配新结点空间

        new_node -> num = i + 1;

        //insert_node_head(head,new_node); //头插
        insert_node_tail(head,new_node); //尾插
    }

    display_link(head); //输出

    int loc;

    printf("输入要插入的值：\n");
    create_node(&new_node);
    scanf("%d",&new_node -> num);
    printf("输入要插入的位置：\n");
    scanf("%d",&loc);

    //insert_node_midf(head,new_node,loc); //中间插入前插
    insert_node_midl(head,new_node,loc); //中间插入后插

    display_link(head);

    int temp;

    printf("输入要删除的结点：\n");
    scanf("%d",&temp);

    delete_node(head,temp); //删除结点

    display_link(head);

    release_link(&head); //释放

    display_link(head);

    return 0;
}

1.题目：创建单链表并赋值，要求遍历能输出1~9

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

struct node
{
    int num;

    struct node * next;
};

typedef struct node Node;
typedef struct node* Link;

void is_malloc_ok(Link node)
{
    if(node == NULL)
    {
        printf("malloc error!\n");
    }
}

void create_node(Link *node)
{
    *node = (Link)malloc(sizeof(Node));
    is_malloc_ok(*node);
}

void create_link(Link *head)
{
    create_node(head);
    (*head)->next = NULL;
}

void insert_node_tail(Link head,Link new_node) //尾插
{
    Link p;

    p = head;

    while(p->next != NULL)
    {
        p = p->next;
    }

    p->next = new_node;
    new_node->next = NULL;
}

void display_link(Link head) //输出
{
    Link p;

    if(head == NULL)
    {
        printf("no such link!\n");
    }

    p = head->next;
    
    while(p != NULL)
    {
        printf("%d\n",p->num);
        p = p->next;
    }
}

int main()
{
    Link head = NULL;
    Link new_node = NULL;
    int i;

    create_link(&head); //创建链表

    for(i = 0;i < 9;i++)
    {
        create_node(&new_node);

        new_node->num = i + 1;

        insert_node_tail(head,new_node); //尾插
    }

    display_link(head);

    return 0;
}

2.题目：读取一个5*5数组，然后显示每行的和与每列的和

#include <stdio.h>
#include <time.h>

int main()
{
    srand((unsigned)time(NULL));

    int a[5][5];
    int i,j;

    for(i = 0;i < 5;i++)
    {
        for(j = 0;j < 5;j++)
        {
            a[i][j] = rand() % 100;
        }
    }

    //输出二维数组
    for(i = 0;i < 5;i++)
    {
        for(j = 0;j < 5;j++)
        {
            printf("%3d",a[i][j]);
        }
        printf("\n");
    }

    int sum1 = 0;
    int sum2 = 0;

    //输出行的和
    for(i = 0;i < 5;i++)
    {
        for(j = 0;j < 5;j++)
        {
            sum1 = sum1 + a[i][j];
        }

        printf("第%d行的和：%d\n",i,sum1);
    }

    //输出列的和
    for(j = 0;j < 5;j++)
    {
        for(i = 0;i < 5;i++)
        {
            sum2 = sum2 + a[i][j];
        }

        printf("第%d列的和：%d\n",j,sum2);
    }

    return 0;
}