C++ 鏈表的遞歸逆轉和循環逆轉

算法比較菜，沒算法天賦呀。。。得多寫。。。  node struct node { int a; node * pnext; } ; void addlist(node * phead,int a) { if(phead == NULL) return ; while (phead->pnext != NULL) { phead = phead ->pnext ; } no

>>阅读原文<<