【C语言】连接两个链表

Dear 丶 2023-07-18 05:52 5阅读 0赞

#include<stdio.h>
    #include<stdlib.h>
    
    struct list
    { 
    	int data;
    	struct list* next;
    };
    
    typedef struct list node;
    typedef node* link;
    
    //删除节点
    link delete_node(link ptr, link tmp)
    { 
    	if (tmp == NULL)
    	{ 
    		return ptr->next;
    	}
    	else
    	{ 
    		if (tmp->next->next == NULL)
    		{ 
    			tmp->next = NULL;
    		}
    		else
    		{ 
    			tmp->next = tmp->next->next;
    		}
    		return ptr;
    	}
    }
    
    //利用选择排序法将链表排序
    void selection_sort(link ptr, int num)
    { 
    	link tmp, btmp;
    	int min = 0;
    	for (int i = 0; i < num; i++)
    	{ 
    		//找到链表中的最小值，将其打印并删除
    		tmp = ptr;
    		min = tmp->data;
    		btmp = NULL;
    		while (tmp->next)
    		{ 
    			if (min > tmp->next->data)
    			{ 
    				min = tmp->next->data;
    				btmp = tmp;
    			}
    			tmp = tmp->next;
    		}
    		printf("\40:%d\n", min);
    		ptr = delete_node(ptr, btmp);
    	}
    }
    
    //创建链表
    link creat_list(int array[], int num)
    { 
    	link ptr, tmp1, tmp2;
    	ptr = (link)malloc(sizeof(node));
    	ptr->data = array[0];
    	tmp1 = ptr;
    	for (int i = 1; i < num; i++)
    	{ 
    		tmp2 = (link)malloc(sizeof(node));
    		tmp2->data = array[i];
    		tmp2->next = NULL;
    		tmp1->next = tmp2;
    		tmp1 = tmp1->next;
    	}
    	return ptr;
    }
    
    //连接两个链表
    link concatenate(link ptr1, link ptr2)
    { 
    	link tmp = ptr1;
    	while (tmp->next)
    	{ 
    		tmp = tmp->next;
    	}
    	tmp->next = ptr2;
    	return ptr1;
    }
    
    int main()
    { 
    	int arr1[] = {  9, 7, 5, 3, 1 };
    	int arr2[] = {  8, 6, 4, 2, 0 };
    	link ptr1 = creat_list(arr1, 5);
    	link ptr2 = creat_list(arr2, 5);
    	concatenate(ptr1, ptr2);
    	selection_sort(ptr1, 10);
    	system("pause");
    	return 0;
    }