学习日志 自习190726

创建一个学生学号及姓名的单链表，即节点包括学生学号、姓名及指向下一个节点的指针，链表按学生的学号排列。再从键盘输入某一学生姓名，将其从链表中删除。 

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

struct head_node
{
    int num;
    char name[30];
    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("link dont exit!\n");
        return;
    }
    p = head->next;
    if ((head->next) == NULL)
    {
        printf("link is empty!\n");
        return;
    }
    while (p != NULL)
    {
        printf("%d\n",p->num);
        printf("%s\n",p->name);
        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_mid(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_sort(Hlink head, Hlink new_node)
{
    Hlink q, p;
    p = head->next;
    q = head;
    while (p != NULL && (p->num) < new_node->num)
    {
        q = p;
        p = p->next;
    }
    new_node->next = p;
    q->next = new_node;
}


void free_link(Hlink head)
{
    Hlink p;
    p = head->next;
    while(head->next != NULL)
    {
        head->next = p->next;
        free(p);
        p = head->next;
    }
}

void release_link(Hlink *head)
{
    free_link(*head);
    free(*head);
    *head = NULL;
}

void delete_node(Hlink head)
{
    Hlink p,q;
    p = q = head->next;
    char b[100];
    printf("Please input a student s name :\n");
    scanf("%s",b);
    while (p != NULL && strcmp((p->name), b))
    {
        q = p;
        p = p->next;
    }
    if (p == NULL)
    {
        printf("Student not found!\n");
    }
    else
    {
        q->next = p->next;
        free(p);
        p = q->next;
    }
}


int main()
{
    Hlink head;
    Hlink new_node;
    int i,loc;
    create_link(&head);
    for (i = 0; i < 6; i++)
    {
        create_node(&new_node);
        printf("Please input student s number :\n");
        scanf("%d",&new_node->num);
        printf("Please input student s name :\n");
        scanf("%s",&new_node->name);
        insert_node_sort(head, new_node);
    }
    display_link(head);
    printf("\n");
    delete_node(head);
    display_link(head);
    printf("\n");
    release_link(&head);
    display_link(head);
    return 0;
}

有n个人围成一圈,顺序排号,从第一个开始报数(从1到3报数),凡报到3的人退出圈子,问最后最后留下的是原来第几号的那位.
提示:用环形链表实现

#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 = * head;
}

int delet_link(Hlink head, int n)
{
    int m;
    Hlink p;
    Hlink q;
    p = q = head -> next;
    while (n > 1)
    {
        m = 1;
        while (m < 3)
        {
            if (p == head)
            {
                p = p->next;
            }
            q = p;
            p = p->next;
            m++;
        }
            if (p == head)
            {
                p = p->next;
                q->next = p->next;
                free(p);
                p = q->next;
                n--;
            }
            else   
            {
        q->next = p->next;
        free(p);
        p = q->next;
        n--;}
    }
    return q->num;
}

void insert_node_tail(Hlink head, Hlink new_node)
{
    Hlink p;
    p = head;
    while (p->next != head)
    {
        p = p->next;
    }
    p->next = new_node;
    new_node->next = head;
}

int main()
{
    Hlink head;
    Hlink new_node;
    head = new_node = NULL;
    int n,i,a;
    create_link(&head);

    printf("Please input n :\n");
    scanf("%d",&n);

    for (i = 0; i < n; i++)
    {
        create_node(&new_node);
        new_node->num = i + 1;
        insert_node_tail(head, new_node);
    }
    
    a = delet_link(head, n);

    printf("%d\n",a);
    return 0;
}