1218C语言练习

输入某个月的第N周和这一周的第M天，通过int *GetDay() 函数获取参数并返回结果，来得出这一天是这个月的第多少天。(如输入：3，4，即这个月的第3周的第4天，即这个月的第18天)

#include <stdio.h>


int  *GetDay( int week , int day)
{
    int month = 0 ;
    month = week*7 + day;
    return month;
}

int main()
{
    int *p = NULL;
    int week ; 
    int day ; 
    printf("plz input week and days : \n");
    scanf("%d", &week);
    scanf("%d", &day);
    printf("the month is : %d\n", (*GetDay)(week , day));
    return 0;
}

（1）建立一个顺序表，要求从键盘输入10个整数，并将该顺序表的元素从屏幕显示出来;（2）用函数实现在顺序表中查找其中一个元素，如果找到，返回该元素在顺序表中的位置和该元素的值，否则提示无此元素;（3）用函数实现顺序表的插入和删除操作。由用户输入待插入元素及插入位置，将完成插入后的顺序表输出；由用户输入删除第几个元素，将完成删除后的顺序表输出。

#include <stdio.h>
#include<stdlib.h>
#define MAL_OK 1
#define MAL_ERR 0

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

typedef struct node Node;
typedef struct node * Link;

void create_link(Link *head)           
    *head = (Link) malloc(sizeof(Node));
    (*head)->next = NULL;
}

void create_node(Link *new_node,int i)        
{
    do
    {
        *new_node = (Link)malloc(sizeof(Node));
    }while(judge_node(*new_node) == MAL_ERR);
    printf("num = %d\n" , i);
    (*new_node)->num = i;
    printf("newnum = %d\n", (*new_node)->num);
}

int judge_node(Link new_node)          
{
    if(new_node == NULL)
    {
        return MAL_ERR;
    }
    else
    {
        return MAL_OK;
    }
}

void insert_node_tail(Link head,Link new_node)
{
    Link p;
    p = head;
    if(head == NULL)
        printf("link is not found\n");
    else
    {
        while(p->next != NULL)
        {
            p = p->next;
        }
        p->next = new_node;
        new_node->next = NULL;
    }
}

void display_link(Link head)              
{
    Link p = NULL;
    p = head -> next;
    if(p == NULL)
    {
        printf("link is empty\n");
    }
    else
    {
        while(p != NULL)
        {
            printf("num = %d\n",p->num);
            p = p->next;
        }
    }
}

void release_link(Link head)    
    Link p;
    Link q;
    q = p = head -> next;
    if(p == NULL)
        printf("link is empty rel\n");
    else
        while(q != NULL)
        {
            q = q -> next;
            head -> next = q;
            free(p);
            p = head -> next;
        }
}

void del_node(Link head , int loc )
{
    Link p , q ;
    p = NULL;
    q = NULL;
    p = q = head -> next;
    if(NULL == p )
    {
        printf("Empty Link ! _del\n");
        return ;
    }
    while(loc != (p -> next) -> num);
    {
        p = p -> next;
        if(NULL == p -> next)
        {
            printf("Not find _del\n");
        }
        q = p -> next ;
        p = q -> next ;
        free(q);
    }
    return ;
}

void change_node(Link head , int loc ,int val)
{
    Link p = NULL;
    if( head -> next == NULL)
    {
        printf("Empty Link _change\n");
        return :
    }
    while(loc != p -> num)
    {
        p = p -> next;
        if(p -> next == NULL)
        {
            printf("Not Find\n");
            return ;
        }
    }
    p -> num = val;
    return ; 
}

int find_node(Link head , int loc)
{
    Link p = head -> next ;
    if( head -> next == NULL)
    {
        printf("Empty Link _change\n");
        return :
    }
    while(loc == (p -> num))
    {
        p = p -> next ;
        if(p -> next == NULL)
        {
            printf("Not Find\n");
            return ;
        }
        return p -> num;
    }
}
int main()
{
    Link head = NULL;
    Link new_node = NULL;
    int i;
    create_link(&head);
    for(i = 1;i < 10;i++)
    {
         create_node(&new_node,i);
         insert_node_tail(head,new_node);
        printf("afterinsert = %d\n",new_node -> num);
    }
    display_link(head);
    printf("\n");
    int loc , val;
    printf("plz input loc and val\n");
    scanf("%d",&loc);
    scanf("%d",&val);
    change_node(head , loc , val);
    desplay_link(head);
    printf("plz input loc to del\n");
    scanf("%d", &loc);
    del_node(head , loc);
    display_link(head);
    release_link(head);
    display_link(head);
    return 0;
}