线性表删除 一个范围内的元素

```cpp
#include<iostream>
using namespace std;
const int Max=50;
    typedef struct
        {
            int a[Max];
            int length;
        }sqlist;
    void creat(sqlist &L,int n);
    void printlist(sqlist &L);
    void shanchu(sqlist &L,int x,int y);
    int  main()
        {`在这里插入代码片`
                cout<<"你想创建几个节点"<<endl;
                int n,x1,x2;
                cin>>n;
                sqlist list1;
                creat(list1,n);
                printlist(list1);
                cout<<"请输入两个范围"<<endl;
                cout<<"上界"<<endl;
                cin>>x1;
                cout<<"下界"<<endl;
                cin>>x2;
                shanchu(list1,x1,x2);
                printlist(list1);
                return 0;

        }

            void creat(sqlist &L,int n)
                {
                    int i=0;
                    cin>>L.a[i];
                    for(i=1;i<=n-1;i++)
                    {
                        cin>>L.a[i];
                        while(L.a[i]<=L.a[i-1])
                        {
                            cout<<"please input again"<<endl;
                            cin>>L.a[i];
                        }

                    }
                    L.length=i;
                }


            void printlist(sqlist &L)
            {
                if(L.length==0)
                {
                    return ;
                }

                else
                {
                    int i;
                    for(i=0;i<=L.length-1;i++)
                    {
                        cout<<L.a[i]<<"  ";
                    }
                    cout<<endl;
                }
            }

        void shanchu(sqlist &L,int x,int y)
            {
                    int i=0,k=0;;
                    while(i<=L.length-1)
                    {
                        if(L.a[i]>=x&&L.a[i]<=y)
                        {
                            k++;    //用·K来记录有多少个范围内的元素
                        }
                        else
                        {
                            L.a[i-k]=L.a[i];  //把不是范围内的元素移到前面
                        }
                        i++;
                    }

                    L.length=L.length-k; //长度发生了变化
            }