链表操做：按值的顺序从小到大， 合并两个链表

Node * merge(Node * h1, Node * h2) { if (h1 == NULL) return h2; if (h2 == NULL) return h1; Node * head; if (h1->data>h2->data) { head = h2; h2=h2->next; } else { head = h1; h1=h1->ne

>>阅读原文<<