求助，数据结构链表删除问题

2023-10-28 19:10:41 318 阅读 AI 写同款 · GEO 优化AI 选题数据监测一键分发 ›

数据结构单链表初始化，插入，删除，等操作的实现 #include<stdio.h> #include<stdlib.h> typedef int ElemType typedef struct LNode { Elemtype data ; struct LNode *next; }LinkList; void InitList_L(LinkList *L)//初始单链表 { L=(LinkList *)mall... 阅读详情

这段代码运行后没有输出是怎么回事

#include <stdio.h>
#include <stdlib.h>

typedef struct Node {
	int data;
	struct Node* next;
}Node;

Node* getNewLinklist(int val) {
	Node* node = (Node*)malloc(sizeof(Node));
	node->data = val;
	node->next = NULL;
	return node;
}

Node* insert(Node* head,int val) {
	Node* new_node = getNewLinklist(val);
	if (head == NULL) { 
		return new_node;
	}
	new_node->next = head;
	return new_node;
}


Node* compare(Node* A, Node* B) {
	Node* prev = B, * tempor = B->next;
	
	while(tempor){
		int k = 0;
		for (Node* p = A; p->next; p = p->next) {
			if (B->data == p->data) {
				B = B->next;
				k = 1;
				break;
			}
			if (tempor->data == p->data) {
				prev->next = tempor->next;
				k = 1;
				break;
			}
		}
		if (k == 1)
			continue;
		tempor = tempor->next;
		prev = prev->next;
	}
	return B;
}


int main() {
	Node* A = NULL,*B = NULL;
	int arr1[] = { 1,2,3,4,5 };
	int arr2[] = { 4,5,6,7,8 };
	for (int i = 0; i < 5; i++) {
		A = insert(A, arr1[i]);
		B = insert(B, arr2[i]);
	}
	Node* C = compare(A, B);
	for (Node* p = C; p; p = p->next) {
		printf("%d ",p->data);
	}
}

...全文