串——C语言版

你的名字 2023-07-19 05:49 2阅读 0赞

## 串——C语言版 ##

博客又改版了，越来越好了，真是令人欣慰

--------------------

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70_pic_center]  
**对于串来说最好的方式就是把下标为0的那个位置空出来，再最后再加一个长度length；**  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70_pic_center 1]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70_pic_center 2]

#include<stdio.h>
    #include<stdlib.h>
    #define MaxSize 10
    typedef struct A
    { 
    	char data[MaxSize];
    	int length;
    }A;
    void chushihua(A& a)
    { 
    	a.length = 0;
    }
    bool qiuzichuan(A& b, A &a, int weizhi, int len)
    { 
    	if ((weizhi + len - 1) > a.length)return false;
    	for (int i = weizhi; i < weizhi + len; i++)
    	{ 
    		b.data[i - weizhi + 1] = a.data[i];
    	}
    	b.length = len;
    	return true;
    }
    int bijiao(A a, A c)
    { 
    	for (int i = 1; i <= a.length && i <= c.length; i++)
    	{ 
    		if (a.data[i] != c.data[i])
    			return a.data[i] - c.data[i];
    	}
    	return a.length - c.length;
    }
    int length(A& k)
    { 
    	return k.length;
    }
    int yncunzichuan(A a, A b)
    { 
    	int i = 1, n = length(a), m=length(b);
    	A sub;
    	while (i <= n - m + 1)
    	{ 
    		qiuzichuan(b, a, i, m);
    		if (bijiao(a, b) != 0)++i;
    	}
    	return 0;
    }
    int main()
    { 
    	A a;
    	chushihua(a);
    	a.data[1] = 'w';
    	a.data[2] = 'a';
    	a.data[3] = 'n';
    	a.data[4] = 'g';
    	a.data[5] = 'd';
    	a.data[6] = 'a';
    	a.data[7] = 'o';
    	a.length = 7;
    	A b;
    	b.length = 0;
    	if (qiuzichuan(b, a, 3, 3))
    	{ 
    		for (int i = 1; i < 4; i++)
    		{ 
    			printf("%c",b.data[i]);
    		}
    		printf("\n");
    		printf("成功！\n");
    	}
    	int zichuan=yncunzichuan(a, b);
    	printf("字串在%d处\n",zichuan);
    	A c;
    	c.data[1] = 'w';
    	c.data[2] = 'a';
    	c.data[3] = 'd';
    	c.data[4] = 'g';
    	c.data[5] = 'd';
    	c.data[6] = 'a';
    	c.data[7] = 'o';
    	c.length = 7;
    	int cc = bijiao(a, c);
    	printf("%d",cc);
    }
    //动态
    /* typedef struct A { char *data; int length; }A; A a; a.data=(char*)malloc(sizeof(char)); a.length=0; */
    //链式存储
    /* typedef struct A { char data[4]; struct A *next; }A,*a; */

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70_pic_center 3]

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70_pic_center]: /images/20230528/93d37cc78d8c4c4ebade4cd53cbacc13.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70_pic_center 1]: /images/20230528/75d0448103374c4389b6c7b84eca33a9.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70_pic_center 2]: /images/20230528/efea66e538ed4e63b6505792825440a9.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMDI2Nzky_size_16_color_FFFFFF_t_70_pic_center 3]: /images/20230528/ac7e9ca1f7404ba4944aac72aca7f75b.png