我一直在研究反转链接列表的代码,但我似乎只在列表中打印出第一个元素。这是我的功能:
void reverseSqueue(Squeue squeue) {
if (squeue -> first == NULL || squeue -> last == NULL){
return;
}
Node* temp = NULL;
Node* curr = squeue -> first;
squeue -> first = squeue -> last;
squeue -> last = curr;
/*if (squeue -> first != squeue -> last){
curr = curr -> next;
}
printf("%s\n", curr -> next -> value);
printf("%s\n", curr -> value);
printf("%s\n", curr -> prev -> value);
printf("______________\n");
printf("%s\n", squeue -> first -> value);
Node* nde = squeue -> first;
while (nde != NULL){
printf("%s\n", nde -> value);
nde = nde -> prev;
}*/
while (curr != NULL){
/*if (curr != squeue -> first || curr != squeue -> last){
if (curr -> next == squeue -> last){
curr = NULL;
}else{*/
temp = curr;
curr -> next = curr;
curr = temp;
curr = curr -> prev;
//}
//}else{
//curr = NULL;
//}
}
}
我为混乱的代码道歉,我尝试运行多个测试并在这里注释掉它们;我之前的代码运行良好,但在 OClint 中给出了垃圾值警告,所以我尝试修复它们,现在我的代码似乎不再工作了。如果没有其他方法,我可以回到我的原始代码。非常感谢任何输入!
struct node {
char *value;
struct node *next;
struct node *prev;
};
typedef struct node Node;
struct squeue {
struct node* first;
struct node* last;
};
typedef struct squeue * Squeue;