CODING无涯苦作舟

摘要： #include<stdio.h>void merge(int a[],int m,int b[],int n,int c[]){ int *p1 = a; int *p2 = b; int i = 0; while(i <= m + n - 1) { if(*p1 <= *p2) { c[i] = *p1; p1++; } else { c[i] = *p2; p2++; ... 阅读全文

摘要： 1 #include<stdio.h> 2 #include<malloc.h> 3 #define LEN sizeof(struct node) 4 typedef struct node* Node; 5 struct node 6 { 7 int num; 8 struct node *next; 9 };10 11 int n = 0;12 //创建单链表13 struct node* creat()14 {15 Node head;16 Node p1,p2;17 p1=p2=(Node)malloc(LEN);18 scanf("... 阅读全文