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

>>阅读原文<<