【练习】c++删除链表倒数第K个结点和 插入排序算法将单链表递增排序

删除单链表倒数第K个结点

运行结果：

代码：

struct node {
    int data;
    node* next;

};
//删除链表的倒数第k个结点
bool delet(node*& L, int k) {
    node* p, * q, * t;
    p = L;
    int i = 0;
    while (i < k) {
        i++;
        p = p->next;
    }
    if (p == NULL)return false;
    q = L;
    while (p->next != NULL) {
        p = p->next;
        q = q->next;
    }
    t = q->next;
    q->next = t->next;
    delete t;
    return true;
}

int main()
{
    srand(0);
    node* m = new node;

    m->data = rand() % 5;
    //cout << m->data;
    node* n = new node;
    n->data = rand() % 7;
    m->next = n;

    node* nn = new node;

    nn->data = rand() % 8;
    n->next = nn;
    node* jj = new node;
    jj->data = 100;
    jj->next = NULL;
    nn->next = jj;
    node* copy_m = m;
    cout << "第一个链表：";
    while (copy_m) {
        cout << copy_m->data<<",";
        copy_m = copy_m->next;
    }
    delet(m, 2);
   copy_m = m;
    cout << "\n删除结点后链表：";
    while (copy_m) {
        cout << copy_m->data<<",";
        copy_m = copy_m->next;
    }



}

直接插入将单链表递增排序

结果：

//直接插入排序
void sort(node*& L) {
    node* p = L->next->next;
  
    node* q;
    L->next->next = NULL;//构建只含一个数据结点的有序表
    node* pre = L;
    while (p != NULL) {
        pre = L;//注意每次最外面的while中都要初始化pre
        q = p->next;//q保存当前p结点的后继结点
        while (pre->next != NULL && pre->next->data < p->data)
            pre = pre->next;
        p->next = pre->next;//当pre->next->data>p->data 在pre后面插入p结点 因为p的数据更小 按递增排序
        pre->next = p;
        p = q;//p指向原来的后继结点
    }
}
int main()
{
    srand(0);
    node* begin=new node;
    begin->next = NULL;
    node* m = new node;

    m->data = rand() % 15;
    //cout << m->data;
      m->next= begin->next;
      begin->next = m;
    node* n = new node;
    n->data = rand() % 7;
  n->next= begin->next;
  begin->next = n;
    node* nn = new node;

    nn->data = rand() % 20;
    nn->next = begin->next;
    begin->next = nn;
    node* jj = new node;
    jj->data = 10;
    jj->next = begin->next;
    begin->next = jj;
    node* copy_m = begin;
    cout << "第一个链表：";
    while (copy_m->next) {
     
        cout << copy_m->next->data<<",";
        copy_m = copy_m->next;
    }
  sort(begin);
   copy_m = begin;
    cout << "\n排序结点后链表：";
    while (copy_m->next) {
 
        cout << copy_m->next->data<<",";
        copy_m = copy_m->next;
    }



}

注意，这里在自己初始化链表的时候发现：
只有写成

 while (copy_m->next) {
 
        cout << copy_m->next->data<<",";
        copy_m = copy_m->next;
    }

时才能正确输出排序后的结果，
如果写成

 while (copy_m) {
  copy_m = copy_m->next;
        cout << copy_m->data<<",";
       
    }

是无法得到排序后结果的。