數(shù)據(jù)結(jié)構(gòu)之雙向循環(huán)鏈表
創(chuàng)新互聯(lián)是一家專注于網(wǎng)站設(shè)計(jì)制作、成都網(wǎng)站制作與策劃設(shè)計(jì),榕城網(wǎng)站建設(shè)哪家好?創(chuàng)新互聯(lián)做網(wǎng)站,專注于網(wǎng)站建設(shè)十多年,網(wǎng)設(shè)計(jì)領(lǐng)域的專業(yè)建站公司;建站業(yè)務(wù)涵蓋:榕城等地區(qū)。榕城做網(wǎng)站價格咨詢:13518219792實(shí)例代碼:
#include <stdlib.h> #include <stdio.h> #include <malloc.h> typedef struct Node{ struct Node *pNext; int data; struct Node *prior; } NODE,*PNODE; PNODE CreatList(); void TreNode(PNODE pHead); bool isEmpty(PNODE pHead); int getCount(PNODE pHead); bool insertNode (PNODE pHead,int pos,int val); bool detNode (PNODE pHead,int pos,int *pVal); void sort(PNODE pHead); int main(){ int val; PNODE pHead = NULL; pHead = CreatList(); TreNode(pHead); printf("鏈表不為空!\n"); printf("鏈表不為空!\n"); if(insertNode(pHead, 4, 7)) printf("插入成功!插入的元素為:%d\n", 7); else printf("插入失敗!\n"); //重新遍歷鏈表 TreNode(pHead); //刪除元素測試 if(detNode(pHead, 3, &val)) printf("元素刪除成功!刪除的元素是:%d\n", val); else printf("元素刪除失敗!\n"); TreNode(pHead); return 0 ; } PNODE CreatList(){ int i ; int val; int length; PNODE pHead = (PNODE)malloc(sizeof(NODE)); if(NULL==pHead) { printf("創(chuàng)建鏈表失敗!\n"); exit(-1); } pHead->pNext = NULL; pHead->prior = NULL; PNODE pTail = pHead; printf("請輸入您想要創(chuàng)建鏈表結(jié)點(diǎn)的個數(shù):len = "); scanf("%d", &length); for(i = 0;i < length;i++){ printf("請輸入第%d個結(jié)點(diǎn)的值:", i+1); scanf("%d", &val); PNODE pnew = (PNODE)malloc(sizeof(NODE)); if(NULL==pHead) { printf("創(chuàng)建鏈表失??!\n"); exit(-1); } pnew->data = val; // pTail->pNext = pnew; pTail->pNext = pnew; pnew->prior = pTail; pnew->pNext = pHead; pHead->prior = pnew; pTail = pnew; } return pHead; } void TreNode(PNODE pHead){ PNODE p = pHead->pNext; while(p!= pHead ){ printf("%d",p->data); p = p->pNext; } printf("\n"); return ; } bool isEmpty(PNODE pHead){ if(NULL==pHead->pNext) return true; else return false; } int getCount(PNODE pHead) { int i =0 ; PNODE p = pHead->pNext; while(NULL != p){ p = p->pNext; i++; } return i ; } bool insertNode (PNODE pHead,int pos,int val){ int i = 0; // PNODE p = pHead; PNODE p =pHead; while(NULL !=p && i<pos-1){ p = p->pNext; i++; } if(NULL == p || i>pos-1) { return false; } scanf("%d", &val); PNODE pNew = (PNODE)malloc(sizeof(NODE)); if(NULL==pNew) { printf("創(chuàng)建鏈表失??!\n"); exit(-1); } pNew ->data = val; PNODE q = p->pNext; p->pNext = pNew; pNew->prior = p; pNew->pNext = q; return true; } bool detNode (PNODE pHead,int pos,int *pVal){ int i = 0; // PNODE p = pHead; PNODE p = pHead; while(NULL !=p && i<pos-1){ p = p->pNext; i++; } if(NULL == p || i>pos-1) { return false; } *pVal = p->pNext->data; PNODE q = p->pNext; p->pNext = p->pNext->pNext; free(q); q = NULL; return true; } void sort(PNODE pHead){ int i,j,k,t; k = getCount(pHead); PNODE p,q; for(i = 0,p=pHead->pNext;i < k-1;i++,p = p->pNext) { for(j = i+1,q = p->pNext;j<k;j++,q = q->pNext){ if(p->data > q->data ){ t = p->data; p->data = q->data; q->data = t; } } } }
另外有需要云服務(wù)器可以了解下創(chuàng)新互聯(lián)建站muchs.cn,海內(nèi)外云服務(wù)器15元起步,三天無理由+7*72小時售后在線,公司持有idc許可證,提供“云服務(wù)器、裸金屬服務(wù)器、高防服務(wù)器、香港服務(wù)器、美國服務(wù)器、虛擬主機(jī)、免備案服務(wù)器”等云主機(jī)租用服務(wù)以及企業(yè)上云的綜合解決方案,具有“安全穩(wěn)定、簡單易用、服務(wù)可用性高、性價比高”等特點(diǎn)與優(yōu)勢,專為企業(yè)上云打造定制,能夠滿足用戶豐富、多元化的應(yīng)用場景需求。
分享文章:C語言數(shù)據(jù)結(jié)構(gòu)之雙向循環(huán)鏈表的實(shí)例-創(chuàng)新互聯(lián)
轉(zhuǎn)載源于:http://muchs.cn/article4/dhghoe.html
成都網(wǎng)站建設(shè)公司_創(chuàng)新互聯(lián),為您提供小程序開發(fā)、云服務(wù)器、網(wǎng)站策劃、Google、關(guān)鍵詞優(yōu)化、商城網(wǎng)站
聲明:本網(wǎng)站發(fā)布的內(nèi)容(圖片、視頻和文字)以用戶投稿、用戶轉(zhuǎn)載內(nèi)容為主,如果涉及侵權(quán)請盡快告知,我們將會在第一時間刪除。文章觀點(diǎn)不代表本網(wǎng)站立場,如需處理請聯(lián)系客服。電話:028-86922220;郵箱:631063699@qq.com。內(nèi)容未經(jīng)允許不得轉(zhuǎn)載,或轉(zhuǎn)載時需注明來源: 創(chuàng)新互聯(lián)
猜你還喜歡下面的內(nèi)容