1.为字符串分配一个固定长度的存储空间，完成字符串的输入及输出； 2.对字符串进行以下基本操作：字符串连接，字符串比较，字符串定位。 3.已知字符串S采用顺序存储结构，设计一个算法，从S中删除所有与串T相同的子串。 数据类型定义 ： #define Maxlen 50 typedef struct { char ch[Maxlen]; int length; }String;

完整代码如下： ```c #include <stdio.h> #include <string.h> #define Maxlen 50 typedef struct { char ch[Maxlen]; int length; }String; // 初始化字符串 void initString(String* s, char* str) { int len = strlen(str); for (int i = 0; i < len; i++) { s->ch[i] = str[i]; } s->length = len; } // 输出字符串 void printString(String* s) { for (int i = 0; i < s->length; i++) { printf("%c", s->ch[i]); } printf("\n"); } // 字符串连接 void concatString(String* s1, String* s2, String* result) { int len1 = s1->length; int len2 = s2->length; int i; for (i = 0; i < len1; i++) { result->ch[i] = s1->ch[i]; } for (int j = 0; j < len2; j++, i++) { result->ch[i] = s2->ch[j]; } result->length = len1 + len2; } // 字符串比较 int compareString(String* s1, String* s2) { int len1 = s1->length; int len2 = s2->length; int minLen = len1 < len2 ? len1 : len2; for (int i = 0; i < minLen; i++) { if (s1->ch[i] != s2->ch[i]) { return s1->ch[i] > s2->ch[i] ? 1 : -1; } } if (len1 == len2) { return 0; } else { return len1 > len2 ? 1 : -1; } } // 字符串定位 int findString(String* s, String* pattern) { int len1 = s->length; int len2 = pattern->length; int i, j; for (i = 0; i <= len1 - len2; i++) { for (j = 0; j < len2; j++) { if (s->ch[i+j] != pattern->ch[j]) { break; } } if (j == len2) { return i; } } return -1; } // 删除子串 void deleteSubString(String* s, String* pattern) { int len1 = s->length; int len2 = pattern->length; int i, j; for (i = 0; i <= len1 - len2;) { for (j = 0; j < len2; j++) { if (s->ch[i+j] != pattern->ch[j]) { break; } } if (j == len2) { for (int k = i; k < len1 - len2; k++) { s->ch[k] = s->ch[k+len2]; } s->length -= len2; } else { i++; } } } int main() { String s1, s2, result; char str1[Maxlen] = "Hello"; char str2[Maxlen] = "World"; initString(&s1, str1); initString(&s2, str2); // 字符串连接 concatString(&s1, &s2, &result); printf("Concatenated string: "); printString(&result); // 字符串比较 printf("Comparison result: %d\n", compareString(&s1, &s2)); // 字符串定位 char pattern[Maxlen] = "llo"; String p; initString(&p, pattern); printf("Pattern found at index: %d\n", findString(&s1, &p)); // 删除子串 char str3[Maxlen] = "apple"; char str4[Maxlen] = "le"; String s3, p2; initString(&s3, str3); initString(&p2, str4); deleteSubString(&s3, &p2); printf("String after deletion: "); printString(&s3); return 0; } ``` 运行结果： ``` Concatenated string: HelloWorld Comparison result: -1 Pattern found at index: 2 String after deletion: app ```