定长顺序栈 C语言

今天药忘吃喽~ 2022-12-03 05:16 114阅读 0赞

##### 主函数 #####

#include <stdio.h>
    #include <stdlib.h>
    
    #include "SString.h"
    
    
    
    int main()
    {
        
        SString s1,s2;
        InitSString(&s1);
        InitSString(&s2);
        printf("s1: %s len:%d\n",s1.ch,s1.len);
        printf("s2: %s len:%d\n",s2.ch,s2.len);
    
        StrInsert(&s1,0,&s2);
        printf("s1: %s len:%d\n",s1.ch,s1.len);
    
        printf("Hello world!\n");
        return 0;
    }

##### string.h #####

#define MAXSIZE 100
    
    typedef struct
    {
        
        char ch[MAXSIZE];
        int len;
    }SString;
    
    
    #define bool char
    #define true 1
    #define false 0
    
    bool InitSString(SString *s)
    {
        
        printf("Input a string: ");
        scanf("%s",s->ch);
        int i;
        for(s->len=0;s->ch[ s->len ]!='\0' && s->len < MAXSIZE;++s->len);
        if(s->len > MAXSIZE)
        {
        
            printf("too long string?");
            return false;
        }
        return true;
    }
    
    bool StrInsert(SString *s,int pos,SString *t)
    {
        
        int i;
        if(pos<0 || pos > s->len)
        {
        
            printf("error pos");
            return false;
        }
        if(s->len + t->len <=MAXSIZE)
        {
        
            for(i=s->len + t->len - 1;i>=pos + t->len;--i)
            {
        
                s->ch[i]=s->ch[i - t->len];
            }
            for(i=0;i<t->len;++i)
            s->len=s->len + t->len;
        }
        else if(pos + t->len <= MAXSIZE)
            {
        
                s->ch[pos+i]=t->ch[i];
            }
            s->len=s->len + t->len;
        }
        else if(pos + t->len <= MAXSIZE)
        {
        
            for(i=MAXSIZE-1;i>=MAXSIZE-pos- t->len;--i)
            {
        
                s->ch[i]=s->ch[i - t->len];
            }
        }
        return true;
    }
    
    
    
    
    
    /*
    
    -finput-charset=GBK
    -fexec-charset=GBK
    */