将两个有序链表合并为一个有序链表

struct link_node{
    int data ;
    struct link_node *next ;
} ;
struct link_node *create_linklist(int arr[],int len) {
    assert(arr!=NULL) ;
    struct link_node *p_head = (struct link_node*)malloc(
                        sizeof(struct link_node)) ;
    struct link_node *p_tmp = p_head ;
    for(int i=0 ; i<len ; i++){
        p_tmp->next = (struct link_node*)malloc(
                    sizeof(struct link_node)) ;
        p_tmp->next->data = arr[i] ;
        p_tmp = p_tmp->next ;
    }
    p_tmp->next = NULL ;
    return p_head ;
}
void print_linklist(struct link_node *p_head){
    assert(p_head!=NULL) ;
    struct link_node *p_tmp = p_head->next ;
    while(p_tmp!=NULL){
        cout<<p_tmp->data<<"," ;
        p_tmp = p_tmp->next ;
    }
    cout<<endl ;
}
int judge_reverse(struct link_node *p_head){
    assert(p_head!=NULL &&