链表插入字母

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

typedef struct List
{
    char str;
    struct List *next;

}List;

List *CreatList ()
{
    List *head, *tail, *p;
    char str;
    str = getchar();
    head = tail = NULL;
    while(str != '\n')
    {
        p = (List *)malloc(sizeof(List));
        p->str = str;
        p->next = NULL;
        if(head == NULL)
        {
            head = p;
        }
        else
        {
            tail->next = p;
        }
        tail = p;
        str = getchar();
    }
    return head;
}

void PrintList (List *head)
{
    List *p;
    for(p = head; p != NULL; p = p->next)
    {
        printf("%c\n", p->str);
    }
}

char FindMax (List *head)
{
    List *p;
    char MAX;
    MAX = p->str;
    for(p = head; p != NULL; p = p->next)
    {
        if(MAX < p->str)
        {
            MAX = p->str;
        }
    }
    return MAX;
}

List *InsertList (List *head, char max)
{
    List *p;
    List *ptr;
    char ch = 'm';
    for(ptr = head; ptr != NULL; ptr = ptr->next)
    {
        if(ptr->str == max)
        {
            p = (List *)malloc(sizeof(List));
            p->str = ch;
            p->next = ptr->next;
            ptr->next = p;
        }
    }
    return head;
}

int main ()
{
    List *head;
    char MAX;
    head = CreatList();
    MAX = FindMax(head);
    printf("%c\n", MAX);
    head = InsertList(head, MAX);
    PrintList(head);
    return 0;
}

  • 0
    点赞
  • 4
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值