河北手机网站制作哪家好,wordpress嵌入视频播放,长沙旅游网站建设,网站官网建设创建两个链表#xff0c;并这两链表连接起来成为一个链表的示例程序#xff0c;将以下代码保存到一个源文件中#xff1a;combine_linked_list.c#xff0c; 如下所示 –#include #include struct node { int data; struct node *next; }; struct node *even NULL; struct…创建两个链表并这两链表连接起来成为一个链表的示例程序将以下代码保存到一个源文件中combine_linked_list.c 如下所示 –#include #include struct node { int data; struct node *next; }; struct node *even NULL; struct node *odd NULL; struct node *list NULL; //Create Linked List void insert(int data) { // Allocate memory for new node; struct node *link (struct node*) malloc(sizeof(struct node)); struct node *current; link-data data; link-next NULL; if (data % 2 0) { if (even NULL) { even link; return; } else { current even; while (current-next ! NULL) current current-next; // Insert link at the end of the list current-next link; } } else { if (odd NULL) { odd link; return; } else { current odd; while (current-next ! NULL) current current-next; // Insert link at the end of the list current-next link; } } } void display(struct node *head) { struct node *ptr head; printf([head] ); while (ptr ! NULL) { printf( %d , ptr-data); ptr ptr-next; } printf( [null]n); } void combine() { struct node *link; list even; link list; while (link-next ! NULL) { link link-next; } link-next odd; } int main() { int i; for (i 1; i 10; i) insert(i); printf(Even : ); display(even); printf(Odd : ); display(odd); combine(); printf(Combined List :n); display(list); return 0; }执行上面程序得到以下结果 –Even : [head] 2 4 6 8 10 [null] Odd : [head] 1 3 5 7 9 [null] Combined List : [head] 2 4 6 8 10 1 3 5 7 9 [null]¥ 我要打赏 纠错/补充 收藏
