您好,登錄后才能下訂單哦!
本篇內(nèi)容介紹了“josephus怎么實(shí)現(xiàn)不帶頭節(jié)點(diǎn)的循環(huán)鏈表”的有關(guān)知識,在實(shí)際案例的操作過程中,不少人都會遇到這樣的困境,接下來就讓小編帶領(lǐng)大家學(xué)習(xí)一下如何處理這些情況吧!希望大家仔細(xì)閱讀,能夠?qū)W有所成!
#include <iostream> #include <cstdlib> using namespace std; typedef struct node { int data; struct node *next; }NODE; NODE* create_circlelist(int n) //建立不帶頭節(jié)點(diǎn)的循環(huán)單鏈表 { NODE* head; NODE* p; NODE* q; p = new NODE; p->data = 1; head = p; for(int i=2;i<=n;i++) { q = new NODE; q->data = i; p->next = q; p = q; //p永遠(yuǎn)指向最后一個節(jié)點(diǎn) } p->next = head; return head; } void josephus(NODE* head,int pos,int step) { int i=1; NODE* front = NULL; NODE* temp = head; while(temp->data != pos) { temp = temp->next; } while(temp!=temp->next) { for(int i=0;i<step-1; i++) { front = temp; temp = temp->next; } cout<<"the"<<i++<<"kill number is:"; cout<<temp->data<<" "<<endl; front->next = temp->next; delete temp; temp = front->next; } cout<<"the "<<i++<<" kill Number is:"; cout<< temp->data<<endl; delete temp; } #if 1 int main(int n, char*m[]) { cout<<"input the size:"; int size; cin>>size; cout<<"input the start pos:"; int pos; cin>>pos; cout<<"input the circle number:"; int step; cin>>step; NODE* head = create_circlelist(size); josephus(head,pos,step); return 0; } #else int main(int n, char*m[]) { int size=atoi(m[1]); int pos =atoi(m[2]); int step =atoi(m[3]); NODE* head = create_circlelist(size); josephus(head,pos,step); return 0; } #endif
“josephus怎么實(shí)現(xiàn)不帶頭節(jié)點(diǎn)的循環(huán)鏈表”的內(nèi)容就介紹到這里了,感謝大家的閱讀。如果想了解更多行業(yè)相關(guān)的知識可以關(guān)注億速云網(wǎng)站,小編將為大家輸出更多高質(zhì)量的實(shí)用文章!
免責(zé)聲明:本站發(fā)布的內(nèi)容(圖片、視頻和文字)以原創(chuàng)、轉(zhuǎn)載和分享為主,文章觀點(diǎn)不代表本網(wǎng)站立場,如果涉及侵權(quán)請聯(lián)系站長郵箱:is@yisu.com進(jìn)行舉報(bào),并提供相關(guān)證據(jù),一經(jīng)查實(shí),將立刻刪除涉嫌侵權(quán)內(nèi)容。