按大小合并两个有序单链表

#include "stdio.h"
#include "stdlib.h"

typedef int zlp;

typedef struct Node{
	zlp data;
	struct Node *next;
}Linklist;

void display(Linklist *a){
	a=a->next;
	while(a!=NULL){
		printf("%d ",a->data);
		a=a->next;
	}
	printf("\n");
	
}

Linklist *creat_one(){
	Linklist *head = (Linklist*)malloc(sizeof(Linklist));
	Linklist *curr = head;
	for(int i=0;i<10;i=i+2){
		Linklist *temp = (Linklist*)malloc(sizeof(Linklist));
		temp->data=i;
		curr->next=temp;
		curr=temp;
	}
	curr->next=NULL;
	
	return head;
}


Linklist *creat_two(){
	Linklist *head = (Linklist*)malloc(sizeof(Linklist));
	Linklist *curr = head;
	for(int i=1;i<10;i=i+2){
		Linklist *temp = (Linklist*)malloc(sizeof(Linklist));
		temp->data=i;
		curr->next=temp;
		curr=temp;
	}
	curr->next=NULL;
	
	return head;
}

Linklist *hebing(Linklist *a,Linklist *b){
	Linklist *head = (Linklist*)malloc(sizeof(Linklist));
	Linklist *curr =head;
	a=a->next;
	b=b->next;
	while(a!=NULL&&b!=NULL){
		if(a->data<=b->data){
			curr->next=a;
			curr=a;
			a=a->next;
		}else{
			curr->next=b;
			curr=b;
			b=b->next;
		}
	}
	if(a!=NULL)curr->next=a;
	if(b!=NULL)curr->next=b;
	
	return head;
	
}

int main(){
	Linklist *o = creat_one();
	Linklist *t = creat_two();
	
	display(o);
	display(t);
	
	Linklist *n = hebing(o,t);
	
	display(n);
	
	return 0;
	
}