//带头结点
void Insert(ListNode* head, int x) {
    ListNode* p, * q;
    p = head->next;
    q = head;
    while (p != NULL && p->data > x) {
        q = p;
        p = p->next;
    }
    p = (ListNode*)malloc(sizeof(ListNode));
    p->data = x;
    p->next = q->next;
    q->next = p;
}
//不带头结点
void NodeIns(LinkList head, int x) {
    ListNode* s, * p, * q;
    s = (ListNode*)malloc(sizeof(ListNode));
    s->data = x;
    s->next = NULL;
    if (head == NULL)
        head = s;
    else {
        p = head;
        q = NULL;
        while (p != NULL && s->data > p->data) {
            q = p;
            p = p->next;
        }
        if (q == NULL) {
            s->next = head;
            head = s;
        }
        else {
            if (p == NULL)
                q->next = s;
            else {
                s->next = q->next;
                q->next = s;
            }
        }
    }
}