单链表L是一个递减有序表，试编写一个高效算法，删除表中值大于min且小于max的结点

单链表L是一个递减有序表，试编写一个高效算法，删除表中值大于min且小于max的结点

#include <iostream>
using namespace std;template<typename T> class Node{public:T data;Node* next;public://初始化Node(){this->next = NULL;this->data = 0; }//打印void print(){Node* p = this->next;while(p!=NULL){cout<<p->data<<" ";p = p->next;}cout<<endl;}//有序创建链表  递减 void creatSort(T ele){Node* p = this; //遍历指向当前结点 Node* pr = this;	//指向当前结点的前一结点while( (p=p->next)!=NULL && p->data>ele ){pr = p;} Node* cur = new Node;cur->data = ele;pr->next = cur;cur->next = p;} //区间删除void del(int min, int max){Node* p = this->next;Node* pr = this;while(p!=NULL){if(p->data>=min && p->data<=max){pr->next = p->next;delete p;p = pr->next;}else{p = p->next;pr = pr->next;}}} 
}; int main(){Node<int> node3;for(int i=1; i<=10; i++){atSort(i);}node3.print();node3.del(2,5);node3.print();return 0;
}