2019.07.24

作业里的程序题
1.输入一段字符串，无论是否有重复字母出现，都只打印出现过的小写字母，并按照小写字母顺序打印。

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

void str(char *s)
{
    int i,j,k,m = 0;
    char t;
    char str1[100];
    
    for(i = 0;*(s+i) != '\0';i++)
    {
        for(j = i + 1;*(s+j) != '\0';j++)
        {
            if(*(s + i) > *(s + j))
            {
                t = *(s + i);
                *(s + i) = *(s + j);
                *(s + j) = t;
            }
        }
    }
    k = i;
    for(i = 0;i < k;i++)
    {
        if(s[i] != s[i + 1])
        {
            str1[m++] = s[i];
        }
        else
        {
            str1[m++] = s[i];
            i = i + 2;
        }
    }
    str1[m] = '\0';
    puts(str1);
}

int main()
{
    void str(char *s);
    char s[100] = {'\0'};
    char s1[100] = {'\0'};

    fgets(s,100,stdin);

    int i,j;
    i = 0;
    j = 0;

    while(s[i] != '\0')
    {
        if(s[i] >= 'a' && s[i] <= 'z')
        {
            s1[j++] = s[i++];
        }
        else
        {
            i++;
        }
        s1[j] = '\0';
    }
    str(s1);

    printf("\n");

    return 0;
}

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

#include <stdio.h>

int *getday(int *a,int week,int day)
{
    int *p;
     p = a + (week - 1) * 7 + day - 1;
     return p;
}

int main()
{
    int i;
    int week;
    int day;
    int a[31];
    int *p;

    p = NULL;

    for(i = 0;i < 31;i++)
    {
        a[i] = i + 1;
    }

    printf("input week and day:");
    scanf("%d%d",&week,&day);

    p = getday(a,week,day);

    printf("the day is : %d day\n",*p);

    return 0;
}

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

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

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

typedef struct node Node;
typedef struct node *Link;

void create_link(Link *head)
{
    * head = NULL;
}

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

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

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;
    }
}

int find_node(Link *head,int b)
{
    Link p;
    p = *head;
    int i = 0;

    if(*head == NULL)
    {
        printf("link is empty!\n");
    }
    else
    {
        while(p -> num != b && p -> next != NULL)
        {
            i++;
            p = p -> next;
        }
        if((p -> next == NULL)&&(p -> num != b))
        {
            printf("can not find this number!\n");
            exit(-1);
        }
        else
        {
            return (i + 1);
        }
    }
}

void insert_node_mid(Link *head,Link new_node,int loc)
{
    Link p,q;
    p = q = *head;

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

void delete_node(Link *head,int d)
{
    Link p,q;
    p = q = *head;
    int i;

    if(*head == NULL)
    {
        printf("error!\n");
    }
    else
    {
        if(d == 1)
        {
            *head = p -> next;
            free(p);
        }
        else
        {
            for(i = 0;i < d - 1;i++)
            {
                q = p;
                p = p -> next;
            }

            q -> next = p -> next;
            free(p);
        }
    }
}

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

void display_link(Link head)
{
    Link p;
    p = head;

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

    putchar('\n');
}

int main()
{
    int i;
    Link head;
    Link new_node;
    int a[10];
    int b;/*要查找的数*/
    int loc;
    int d;/*要删除的数*/

    create_link(&head);

    for(i = 0;i < 10;i++)
    {
        scanf("%d",&a[i]);
    }

    for(i = 0;i < 10;i++)
    {
        create_node(&new_node);
        new_node -> num = a[i];
        insert_node_tail(&head,new_node);
    }

    display_link(head);

    create_node(&new_node);
    
    printf("please input a number to find:");
    scanf("%d",&b);
    printf("the number is NO.%d\n",find_node(&head,b));

    printf("please input a number for new_node:");
    scanf("%d",&new_node -> num);

    printf("please input a number for insert location:");
    scanf("%d",&loc);

    insert_node_mid(&head,new_node,loc);
    
    puts("after inserting");

    display_link(head);

    printf("please input a number to delete:");
    scanf("%d",&d);

    delete_node(&head,d);

    puts("after deleting");

    display_link(head);

    release_link(&head);

    display_link(head);

    return 0;
}