2.19.cpp

严蔚敏数据结构习题C++实现

#include <iostream> 
using namespace std; 
typedef int ElemType;
typedef struct LinkNode
{
    ElemType item;
    LinkNode* next;
}LinkNode,*LinkList;
void init_link(LinkList& L,int n);
void delete_part(LinkList& L,const ElemType mink,const ElemType maxk);
void link_play(const LinkList L);
int main()
{
    int mink,maxk,n;
    cin >> n >> mink >> maxk;
    LinkList L;
    init_link(L,n);
    link_play(L);
    cout << endl;
    delete_part(L,mink,maxk);
    link_play(L);
    system("pause");
    return 0;
}
void init_link(LinkList& L,int n)
{
     L = new LinkNode();
     LinkList p;
     LinkNode* temp = L;
     L->next = NULL;
     for(int i=1; i<=n; i++)
     {
         p = new LinkNode();
         L->next = p;
         p->next = NULL;
         p->item = 4*i;
         L = p;
     }
     L = temp;
}
void link_play(const LinkList L)
{
     LinkNode* temp = L->next;
     while(temp!=NULL)
     {
         cout << temp->item << ' ';
         temp = temp->next;
     }
}
void delete_part(LinkList& L,const ElemType mink,const ElemType maxk)
{
     LinkNode* temp = L;
     LinkNode* LaJi;
     while(temp->next!=NULL)
     {
         if(temp->next->item<maxk && temp->next->item>mink)
         {
             LaJi = temp->next;
             temp->next = temp->next->next;
             free(LaJi);
         }
         else
         temp = temp->next;
     }
             
}