小編給大家分享一下C語(yǔ)言如何實(shí)現(xiàn)數(shù)據(jù)結(jié)構(gòu)串,相信大部分人都還不怎么了解,因此分享這篇文章給大家參考一下,希望大家閱讀完這篇文章后大有收獲,下面讓我們一起去了解一下吧!
網(wǎng)站建設(shè)哪家好,找創(chuàng)新互聯(lián)!專(zhuān)注于網(wǎng)頁(yè)設(shè)計(jì)、網(wǎng)站建設(shè)、微信開(kāi)發(fā)、微信平臺(tái)小程序開(kāi)發(fā)、集團(tuán)企業(yè)網(wǎng)站建設(shè)等服務(wù)項(xiàng)目。為回饋新老客戶(hù)創(chuàng)新互聯(lián)還提供了紫云免費(fèi)建站歡迎大家使用!
堆分配存儲(chǔ)表示法
存儲(chǔ)結(jié)構(gòu):
構(gòu)建堆來(lái)存儲(chǔ)字符串,本質(zhì)上是順序表
實(shí)現(xiàn)代碼:
#include <stdio.h> #include <stdlib.h> #include <string.h> #define OK 1 #define ERROR 0 #define TRUE 1 #define FALSE 0 #define OVERFLOW -2 #define STR_INIT_SIZE 100 #define STRINCREMENT 10 typedef int Status; typedef struct { char *ch; //空串時(shí)指向NULL,非空串時(shí)按串長(zhǎng)分配存儲(chǔ)區(qū) int length; } HString; Status InitString(HString *T) //初始化字符串 { //指針指向NULL,長(zhǎng)度為0即可 //p.s.申請(qǐng)內(nèi)存空間的過(guò)程在賦值中完成 T->ch = NULL; T->length = 0; return OK; } Status StrAssign(HString *T, char *p) //字符串賦值 { //1.判斷T是否已有內(nèi)容,有則釋放 //2.判斷賦值的內(nèi)容是否為空,為空則不賦值 //3.根據(jù)長(zhǎng)度向內(nèi)存申請(qǐng)空間,遍歷賦值給T,長(zhǎng)度等于字符串長(zhǎng)度 //p.s.在這里賦值不賦\0,在打印時(shí)通過(guò)長(zhǎng)度來(lái)判斷字符串結(jié)尾 int i, len = strlen(p); if (T->ch) free(T->ch); if (!len) { T->ch = NULL; T->length = 0; return ERROR; } else { T->ch = (char *)malloc(len * sizeof(char)); if(!T->ch) exit(OVERFLOW); for (i = 0; i < len; ++i) T->ch[i] = p[i]; T->length = len; return OK; } } Status StrPrint(HString T) //打印字符串 { //通過(guò)長(zhǎng)度判斷打印的字符數(shù) int i; for (i = 0; i < T.length; ++i) printf("%c", T.ch[i]); printf("\n"); } Status StrLength(HString T) //字符串長(zhǎng)度 { return T.length; } Status StrEmpty(HString T) //字符串判空 { if (T.length == 0) return TRUE; else return FALSE; } Status Concat(HString *T, HString S1, HString S2) //字符串聯(lián)接 { //1.申請(qǐng)長(zhǎng)度為S1和S2之和的字符串空間 //2.先將S1的元素逐個(gè)賦值到T中 //3.再將S2的元素逐個(gè)賦值到T中 int i; if (T->ch) free(T->ch); T->ch = (char *)malloc((S1.length + S2.length) * sizeof(char)); if (!T->ch) exit(OVERFLOW); for (i = 0; i < S1.length; ++i) T->ch[i] = S1.ch[i]; for (i = 0; i < S2.length; ++i) T->ch[i + S1.length] = S2.ch[i]; T->length = S1.length + S2.length; return OK; } Status StrDelete(HString *T, int pos, int len) //刪除字符串中某個(gè)位置固定長(zhǎng)度的子串 { //pos是字符串中的位置,刪除包括pos的len長(zhǎng)度 int i; if (pos >= T->length) return ERROR; else if(pos + len > T->length) len = T->length - pos + 1; for (i = pos - 1; i < T->length - len; ++i) T->ch[i] = T->ch[i + len]; T->length -= len; T->ch = (char *)realloc(T->ch, T->length * sizeof(char)); if (!T->ch) exit(OVERFLOW); return OK; } Status StrInsert(HString *S, int pos, HString T) { //pos是字符串中的位置,插入時(shí)原來(lái)的元素(包括pos位)后移 int i, len; --pos; len = StrLength(T); S->ch = (char *)realloc(S->ch, (S->length + len) * sizeof(char)); if (pos > S->length) pos = S->length; for (i = S->length - 1; i > pos - 1; --i) S->ch[i + len] = S->ch[i]; for (i = 0; i < len; ++i) S->ch[i + pos] = T.ch[i]; S->length += len; if (!S->ch) exit(OVERFLOW); return OK; } Status Index(HString S, HString T, int pos) //在字符串S中索引位置pos之后的子串t { //同定長(zhǎng)順序存儲(chǔ)表示法 //p.s.傳入的pos是字符串的位置,從1開(kāi)始 //p.s.初始狀態(tài)下T為非空串 if (StrEmpty(T)) return ERROR; int i = pos - 1, j = 0; while(i < S.length && j < T.length) { if (S.ch[i] == T.ch[j]) { ++i; ++j; } else { i = i - j + 1; j = 0; } } if (j >= T.length) return i - j + 1; else return 0; } Status Replace(HString *T, HString S1, HString S2) //將字符串T中等于S1的子串替換成為S2 { //循環(huán)索引子串S1在字符串T中的位置(每次的位置從上一次位置后開(kāi)始查找) //從查找到的位置-1開(kāi)始替換 //p.s.初始狀態(tài)下S1為非空串 int pos = 0; if (StrEmpty(S1)) return ERROR; //當(dāng)pos存在時(shí)循環(huán),當(dāng)全部索引完畢后pos為0 //將索引到的該位置對(duì)應(yīng)的子串刪除后再插入新的子串 do { pos = Index(*T, S1, pos); if (pos) { StrDelete(T, pos, StrLength(S1)); StrInsert(T, pos, S2); } } while(pos); return OK; } Status SubString(HString *Sub, HString S, int pos, int len) { int i; if (pos < 1 || len > S.length || len < 0 || len > S.length - pos + 1) exit(OVERFLOW); if (Sub->ch) free(Sub->ch); //如果查詢(xún)的長(zhǎng)度為0,則子串置空 if (len == 0) { Sub->ch = NULL; Sub->length = 0; } else { Sub->ch = (char *)malloc(len * sizeof(char)); for (i = 0; i < len; ++i) Sub->ch[i] = S.ch[pos + i - 1]; Sub->length = len; } return OK; } int main() { int pos; HString t, s, r; char *p = "Hello,String!", *q = "Bye,Bye!"; printf("String *p: %s\n", p); InitString(&t); StrAssign(&t, p); printf("StrAssign... OK.\nString t : "); StrPrint(t); printf("------------------------------\n"); printf("StrLength... OK.\nString Length : %d\n", StrLength(t)); printf("StrEmpty... OK.\n"); if (StrEmpty(t)) printf("String is Empty.\n"); else printf("String is not Empty.\n"); printf("------------------------------\n"); InitString(&s); StrAssign(&s, q); printf("String s : "); StrPrint(s); printf("------------------------------\n"); InitString(&r); Concat(&r, t, s); printf("Concat... OK.\n"); printf("String r : "); StrPrint(r); printf("------------------------------\n"); printf("StrDelete... OK.\n"); StrDelete(&r, 14, 4); printf("String r : "); StrPrint(r); printf("------------------------------\n"); printf("StrInsert... OK.\n"); StrAssign(&t, "Bye,Bye,Bye!"); StrInsert(&r, 14, t); printf("String r : "); StrPrint(r); printf("------------------------------\n"); StrAssign(&t, "ye"); printf("Index... "); StrPrint(t); pos = 1; while(pos) { pos = Index(r, t, pos + 1); if (!pos) break; printf("Position : %d\n", pos); } printf("------------------------------\n"); StrAssign(&t, "ye"); StrAssign(&s, "oo"); Replace(&r, t, s); printf("Replace ye -> ooo ... OK.\n"); printf("String r : "); StrPrint(r); printf("------------------------------\n"); SubString(&t, r, 7, 4); printf("SubString... OK.\n"); printf("String SubString : "); StrPrint(t); printf("------------------------------\n"); return OK; }
以上是“C語(yǔ)言如何實(shí)現(xiàn)數(shù)據(jù)結(jié)構(gòu)串”這篇文章的所有內(nèi)容,感謝各位的閱讀!相信大家都有了一定的了解,希望分享的內(nèi)容對(duì)大家有所幫助,如果還想學(xué)習(xí)更多知識(shí),歡迎關(guān)注創(chuàng)新互聯(lián)行業(yè)資訊頻道!
分享標(biāo)題:C語(yǔ)言如何實(shí)現(xiàn)數(shù)據(jù)結(jié)構(gòu)串
網(wǎng)站鏈接:http://jinyejixie.com/article44/podgee.html
成都網(wǎng)站建設(shè)公司_創(chuàng)新互聯(lián),為您提供小程序開(kāi)發(fā)、網(wǎng)站制作、動(dòng)態(tài)網(wǎng)站、商城網(wǎng)站、App設(shè)計(jì)、定制網(wǎng)站
聲明:本網(wǎng)站發(fā)布的內(nèi)容(圖片、視頻和文字)以用戶(hù)投稿、用戶(hù)轉(zhuǎn)載內(nèi)容為主,如果涉及侵權(quán)請(qǐng)盡快告知,我們將會(huì)在第一時(shí)間刪除。文章觀點(diǎn)不代表本網(wǎng)站立場(chǎng),如需處理請(qǐng)聯(lián)系客服。電話:028-86922220;郵箱:631063699@qq.com。內(nèi)容未經(jīng)允許不得轉(zhuǎn)載,或轉(zhuǎn)載時(shí)需注明來(lái)源: 創(chuàng)新互聯(lián)