思想和代碼都不難，和線性表也差不多，串本來就是數(shù)據(jù)受限的線性表。

串連接：

?

#include <stdio.h> #include <string.h> //串的定長(zhǎng)順序存儲(chǔ)表示 #define MAXSTRLEN 255 //用戶可在255以內(nèi)定義最大串長(zhǎng) typedef unsigned char SString[MAXSTRLEN + 1]; //0號(hào)單元存放串的長(zhǎng)度int Concat(SString *T,SString S1,SString S2)//用T返回S1和S2聯(lián)接而成的新串。若未截?cái)喾祷?，若截?cái)喾祷? {int i = 1,j,uncut = 0;if(S1[0] + S2[0] <= MAXSTRLEN) //未截?cái)鄘for (i = 1; i <= S1[0]; i++)//賦值時(shí)等號(hào)不可丟(*T)[i] = S1[i];for (j = 1; j <= S2[0]; j++)(*T)[S1[0]+j] = S2[j]; //(*T)[i+j] = S2[j](*T)[0] = S1[0] + S2[0];uncut = 1;}else if(S1[0] < MAXSTRLEN) //截?cái)鄘for (i = 1; i <= S1[0]; i++)//賦值時(shí)等號(hào)不可丟(*T)[i] = S1[i];for (j = S1[0] + 1; j <= MAXSTRLEN; j++){(*T)[j] = S2[j - S1[0] ];(*T)[0] = MAXSTRLEN;uncut = 0;}}else{for (i = 0; i <= MAXSTRLEN; i++)(*T)[i] = S1[i];/*或者分開賦值，先賦值內(nèi)容，再賦值長(zhǎng)度f(wàn)or (i = 1; i <= MAXSTRLEN; i++)(*T)[i] = S1[i];(*T)[0] = MAXSTRLEN;*/uncut = 0;}return uncut; }int SubString(SString *Sub,SString S,int pos,int len)//用Sub返回串S的第pos個(gè)字符起長(zhǎng)度為len的子串//其中，1 ≤ pos ≤ StrLength(S)且0 ≤ len ≤ StrLength(S) - pos + 1(從pos開始到最后有多少字符)//第1個(gè)字符的下標(biāo)為1,因?yàn)榈?個(gè)字符存放字符長(zhǎng)度 {int i;if(pos < 1 || pos > S[0] || len < 0 || len > S[0] - pos + 1)return 0;for (i = 1; i <= len; i++){//S中的[pos,len]的元素 -> *Sub中的[1,len](*Sub)[i] = S[pos + i - 1];//下標(biāo)運(yùn)算符 > 尋址運(yùn)算符的優(yōu)先級(jí)}(*Sub)[0] = len;return 1; } void PrintStr(SString S) {int i;for (i = 1; i <= S[0]; i++)printf("%c",S[i]);printf("\n"); }int main(void) {/*定長(zhǎng)順序存儲(chǔ)初始化和打印的方法SString s = {4,'a','b','c','d'};int i;//s = "abc"; //不可直接賦值for (i = 1; i <= s[0]; i++)printf("%c",s[i]);*/SString s1 = {4,'a','b','c','d'};SString s2 = {4,'e','f','g','h'},s3;SString T,Sub;int i;for (i = 1; i <= 255; i++){s3[i] = 'a';if(i >= 248)s3[i] = 'K';}s3[0] = 255;SubString(&Sub,s3,247,8);PrintStr(Sub);return 0; }

?

總結(jié)

以上是生活随笔為你收集整理的串的定长表示的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。