有序表合并---链表（记）

最新推荐文章于 2024-06-11 19:36:10 发布

ulm23

最新推荐文章于 2024-06-11 19:36:10 发布

阅读量57

点赞数

文章标签：数据结构算法 c++

原文链接：https://blog.csdn.net/m0_46518461/article/details/109150770

版权

typedef struct list {
	int val;
	struct list* next;
}Node,*linklist;

linklist conmine(Node* A, Node* B, Node* C) {
	Node* pa, * pb, * pc;
	pa = A->next;
	pb = B->next;
	C = A;//C等于A的头结点
	pc = C;
	while (pa != NULL && pb != NULL) {
		if (pa->val <= pb->val) {
			pc->next = pa;
			pc = pa;
			pa = pa->next;

		}
		else {
			pc->next = pb;
			pc = pb;
			pb = pb->next;
		}
	}
	pc->next = pa ? pa : pb;
	free(B);
	return C;