第四周项目5-循环双链表应用

于 2016-09-22 10:40:23 发布
阅读量195 收藏
点赞数
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/vip____/article/details/52619826
版权

问题及代码：

/* 
* Copyright (c)2016,烟台大学计算机与控制工程学院 
* All rights reserved. 
* 文件名称：项目5.cpp 
* 作    者：董雪 
* 完成日期：2016年9月22日 
* 版 本 号：v1.0  
*问题描述：设非空线性表ha和hb都用带头节点的循环双链表表示。设计一个算法Insert(ha,hb,i)。
          其功能是：i=0时，将线性表hb插入到线性表ha的最前面；当i>0时，将线性表hb插入到
          线性表ha中第i个节点的后面；当i大于等于线性表ha的长度时，将线性表hb插入到线性表ha的最后面。 
*输入描述：无。  
*程序输出：新链表。  
*/  
1.头文件：cdlinklist.h，包含定义双链表数据结构的代码、宏定义、要实现算法的函数的声明；<pre class="prettyprint"><code class=" hljs vala"><span class="hljs-preprocessor">#ifndef CDLINKLIST_H_INCLUDED</span>
<span class="hljs-preprocessor">#define CDLINKLIST_H_INCLUDED</span>

<span class="hljs-comment">//循环双链表基本运算函数</span>
typedef <span class="hljs-keyword">int</span> ElemType;
typedef <span class="hljs-keyword">struct</span> DNode        <span class="hljs-comment">//定义双链表结点类型</span>
{
    ElemType data;
    <span class="hljs-keyword">struct</span> DNode *prior;    <span class="hljs-comment">//指向前驱结点</span>
    <span class="hljs-keyword">struct</span> DNode *next;     <span class="hljs-comment">//指向后继结点</span>
} CDLinkList;

<span class="hljs-keyword">void</span> CreateListF(CDLinkList *&L,ElemType a[],<span class="hljs-keyword">int</span> n); <span class="hljs-comment">//头插法建立循环双链表</span>
<span class="hljs-keyword">void</span> CreateListR(CDLinkList *&L,ElemType a[],<span class="hljs-keyword">int</span> n); <span class="hljs-comment">//尾插法建立循环双链表</span>
<span class="hljs-keyword">void</span> InitList(CDLinkList *&L); <span class="hljs-comment">//初始化循环双链表</span>
<span class="hljs-keyword">void</span> DestroyList(CDLinkList *&L);  <span class="hljs-comment">//销毁</span>
<span class="hljs-keyword">bool</span> ListEmpty(CDLinkList *L); <span class="hljs-comment">//判断是否为空</span>
<span class="hljs-keyword">int</span> ListLength(CDLinkList *L); <span class="hljs-comment">//求链表长度</span>
<span class="hljs-keyword">void</span> DispList(CDLinkList *L);  <span class="hljs-comment">//输出链表</span>
<span class="hljs-keyword">bool</span> GetElem(CDLinkList *L,<span class="hljs-keyword">int</span> i,ElemType &e);  <span class="hljs-comment">//取链表元素</span>
<span class="hljs-keyword">int</span> LocateElem(CDLinkList *L,ElemType e);  <span class="hljs-comment">//查找元素</span>
<span class="hljs-keyword">bool</span> ListInsert(CDLinkList *&L,<span class="hljs-keyword">int</span> i,ElemType e);  <span class="hljs-comment">//插入节点</span>
<span class="hljs-keyword">bool</span> ListDelete(CDLinkList *&L,<span class="hljs-keyword">int</span> i,ElemType &e);  <span class="hljs-comment">//删除节点</span>

2.源文件：cdlinklist.cpp，包含实现各种算法的函数的定义</code><pre class="prettyprint"><code class=" hljs cpp"><span class="hljs-comment">//循环双链表基本运算函数</span>
<span class="hljs-preprocessor">#include <stdio.h></span>
<span class="hljs-preprocessor">#include <malloc.h></span>
<span class="hljs-preprocessor">#include "cdlinklist.h"</span>
<span class="hljs-keyword">void</span> CreateListF(CDLinkList *&L,ElemType a[],<span class="hljs-keyword">int</span> n) <span class="hljs-comment">//头插法建立循环双链表</span>
{
    CDLinkList *s;
    <span class="hljs-keyword">int</span> i;
    L=(CDLinkList *)<span class="hljs-built_in">malloc</span>(<span class="hljs-keyword">sizeof</span>(CDLinkList));     <span class="hljs-comment">//创建头结点</span>
    L->next=NULL;
    <span class="hljs-keyword">for</span> (i=<span class="hljs-number">0</span>; i<n; i++)
    {
        s=(CDLinkList *)<span class="hljs-built_in">malloc</span>(<span class="hljs-keyword">sizeof</span>(CDLinkList));<span class="hljs-comment">//创建新结点</span>
        s->data=a[i];
        s->next=L->next;            <span class="hljs-comment">//将*s插在原开始结点之前,头结点之后</span>
        <span class="hljs-keyword">if</span> (L->next!=NULL) L->next->prior=s;
        L->next=s;
        s->prior=L;
    }
    s=L->next;
    <span class="hljs-keyword">while</span> (s->next!=NULL)           <span class="hljs-comment">//查找尾结点,由s指向它</span>
        s=s->next;
    s->next=L;                      <span class="hljs-comment">//尾结点next域指向头结点</span>
    L->prior=s;                     <span class="hljs-comment">//头结点的prior域指向尾结点</span>

}
<span class="hljs-keyword">void</span> CreateListR(CDLinkList *&L,ElemType a[],<span class="hljs-keyword">int</span> n) <span class="hljs-comment">//尾插法建立循环双链表</span>
{
    CDLinkList *s,*r;
    <span class="hljs-keyword">int</span> i;
    L=(CDLinkList *)<span class="hljs-built_in">malloc</span>(<span class="hljs-keyword">sizeof</span>(CDLinkList));  <span class="hljs-comment">//创建头结点</span>
    L->next=NULL;
    r=L;                    <span class="hljs-comment">//r始终指向尾结点,开始时指向头结点</span>
    <span class="hljs-keyword">for</span> (i=<span class="hljs-number">0</span>; i<n; i++)
    {
        s=(CDLinkList *)<span class="hljs-built_in">malloc</span>(<span class="hljs-keyword">sizeof</span>(CDLinkList));<span class="hljs-comment">//创建新结点</span>
        s->data=a[i];
        r->next=s;
        s->prior=r; <span class="hljs-comment">//将*s插入*r之后</span>
        r=s;
    }
    r->next=L;              <span class="hljs-comment">//尾结点next域指向头结点</span>
    L->prior=r;             <span class="hljs-comment">//头结点的prior域指向尾结点</span>
}
<span class="hljs-keyword">void</span> InitList(CDLinkList *&L) <span class="hljs-comment">//初始化循环双链表</span>
{
    L=(CDLinkList *)<span class="hljs-built_in">malloc</span>(<span class="hljs-keyword">sizeof</span>(CDLinkList));     <span class="hljs-comment">//创建头结点</span>
    L->prior=L->next=L;
}
<span class="hljs-keyword">void</span> DestroyList(CDLinkList *&L)  <span class="hljs-comment">//销毁</span>
{
    CDLinkList *p=L,*q=p->next;
    <span class="hljs-keyword">while</span> (q!=L)
    {
        <span class="hljs-built_in">free</span>(p);
        p=q;
        q=p->next;
    }
    <span class="hljs-built_in">free</span>(p);
}
<span class="hljs-keyword">bool</span> ListEmpty(CDLinkList *L) <span class="hljs-comment">//判断是否为空</span>
{
    <span class="hljs-keyword">return</span>(L->next==L);
}
<span class="hljs-keyword">int</span> ListLength(CDLinkList *L) <span class="hljs-comment">//求链表长度</span>
{
    CDLinkList *p=L;
    <span class="hljs-keyword">int</span> i=<span class="hljs-number">0</span>;
    <span class="hljs-keyword">while</span> (p->next!=L)
    {
        i++;
        p=p->next;
    }
    <span class="hljs-keyword">return</span>(i);
}
<span class="hljs-keyword">void</span> DispList(CDLinkList *L)  <span class="hljs-comment">//输出链表</span>
{
    CDLinkList *p=L->next;
    <span class="hljs-keyword">while</span> (p!=L)
    {
        <span class="hljs-built_in">printf</span>(<span class="hljs-string">"%d "</span>,p->data);
        p=p->next;
    }
    <span class="hljs-built_in">printf</span>(<span class="hljs-string">"\n"</span>);
}
<span class="hljs-keyword">bool</span> GetElem(CDLinkList *L,<span class="hljs-keyword">int</span> i,ElemType &e)  <span class="hljs-comment">//取链表元素</span>
{
    <span class="hljs-keyword">int</span> j=<span class="hljs-number">0</span>;
    CDLinkList *p;
    <span class="hljs-keyword">if</span> (L->next!=L)     <span class="hljs-comment">//双链表不为空表时</span>
    {
        <span class="hljs-keyword">if</span> (i==<span class="hljs-number">1</span>)
        {
            e=L->next->data;
            <span class="hljs-keyword">return</span> <span class="hljs-keyword">true</span>;
        }
        <span class="hljs-keyword">else</span>            <span class="hljs-comment">//i不为1时</span>
        {
            p=L->next;
            <span class="hljs-keyword">while</span> (j<i-<span class="hljs-number">1</span> && p!=L)
            {
                j++;
                p=p->next;
            }
            <span class="hljs-keyword">if</span> (p==L)
                <span class="hljs-keyword">return</span> <span class="hljs-keyword">false</span>;
            <span class="hljs-keyword">else</span>
            {
                e=p->data;
                <span class="hljs-keyword">return</span> <span class="hljs-keyword">true</span>;
            }
        }
    }
    <span class="hljs-keyword">else</span>                <span class="hljs-comment">//双链表为空表时</span>
        <span class="hljs-keyword">return</span> <span class="hljs-number">0</span>;
}
<span class="hljs-keyword">int</span> LocateElem(CDLinkList *L,ElemType e)  <span class="hljs-comment">//查找元素</span>
{
    <span class="hljs-keyword">int</span> n=<span class="hljs-number">1</span>;
    CDLinkList *p=L->next;
    <span class="hljs-keyword">while</span> (p!=NULL && p->data!=e)
    {
        n++;
        p=p->next;
    }
    <span class="hljs-keyword">if</span> (p==NULL)
        <span class="hljs-keyword">return</span>(<span class="hljs-number">0</span>);
    <span class="hljs-keyword">else</span>
        <span class="hljs-keyword">return</span>(n);
}
<span class="hljs-keyword">bool</span> ListInsert(CDLinkList *&L,<span class="hljs-keyword">int</span> i,ElemType e)  <span class="hljs-comment">//插入节点</span>
{
    <span class="hljs-keyword">int</span> j=<span class="hljs-number">0</span>;
    CDLinkList *p=L,*s;
    <span class="hljs-keyword">if</span> (p->next==L)                 <span class="hljs-comment">//原双链表为空表时</span>
    {
        s=(CDLinkList *)<span class="hljs-built_in">malloc</span>(<span class="hljs-keyword">sizeof</span>(CDLinkList)); <span class="hljs-comment">//创建新结点*s</span>
        s->data=e;
        p->next=s;
        s->next=p;
        p->prior=s;
        s->prior=p;
        <span class="hljs-keyword">return</span> <span class="hljs-keyword">true</span>;
    }
    <span class="hljs-keyword">else</span> <span class="hljs-keyword">if</span> (i==<span class="hljs-number">1</span>)                  <span class="hljs-comment">//原双链表不为空表但i=1时</span>
    {
        s=(CDLinkList *)<span class="hljs-built_in">malloc</span>(<span class="hljs-keyword">sizeof</span>(CDLinkList)); <span class="hljs-comment">//创建新结点*s</span>
        s->data=e;
        s->next=p->next;
        p->next=s;  <span class="hljs-comment">//将*s插入到*p之后</span>
        s->next->prior=s;
        s->prior=p;
        <span class="hljs-keyword">return</span> <span class="hljs-keyword">true</span>;
    }
    <span class="hljs-keyword">else</span>
    {
        p=L->next;
        <span class="hljs-keyword">while</span> (j<i-<span class="hljs-number">2</span> && p!=L)
        {
            j++;
            p=p->next;
        }
        <span class="hljs-keyword">if</span> (p==L)               <span class="hljs-comment">//未找到第i-1个结点</span>
            <span class="hljs-keyword">return</span> <span class="hljs-keyword">false</span>;
        <span class="hljs-keyword">else</span>                    <span class="hljs-comment">//找到第i-1个结点*p</span>
        {
            s=(CDLinkList *)<span class="hljs-built_in">malloc</span>(<span class="hljs-keyword">sizeof</span>(CDLinkList)); <span class="hljs-comment">//创建新结点*s</span>
            s->data=e;
            s->next=p->next;    <span class="hljs-comment">//将*s插入到*p之后</span>
            <span class="hljs-keyword">if</span> (p->next!=NULL) p->next->prior=s;
            s->prior=p;
            p->next=s;
            <span class="hljs-keyword">return</span> <span class="hljs-keyword">true</span>;
        }
    }
}
<span class="hljs-keyword">bool</span> ListDelete(CDLinkList *&L,<span class="hljs-keyword">int</span> i,ElemType &e)  <span class="hljs-comment">//删除节点</span>
{
    <span class="hljs-keyword">int</span> j=<span class="hljs-number">0</span>;
    CDLinkList *p=L,*q;
    <span class="hljs-keyword">if</span> (p->next!=L)                 <span class="hljs-comment">//原双链表不为空表时</span>
    {
        <span class="hljs-keyword">if</span> (i==<span class="hljs-number">1</span>)                   <span class="hljs-comment">//i==1时</span>
        {
            q=L->next;              <span class="hljs-comment">//删除第1个结点</span>
            e=q->data;
            L->next=q->next;
            q->next->prior=L;
            <span class="hljs-built_in">free</span>(q);
            <span class="hljs-keyword">return</span> <span class="hljs-keyword">true</span>;
        }
        <span class="hljs-keyword">else</span>                        <span class="hljs-comment">//i不为1时</span>
        {
            p=L->next;
            <span class="hljs-keyword">while</span> (j<i-<span class="hljs-number">2</span> && p!=NULL)
            {
                j++;
                p=p->next;
            }
            <span class="hljs-keyword">if</span> (p==NULL)                <span class="hljs-comment">//未找到第i-1个结点</span>
                <span class="hljs-keyword">return</span> <span class="hljs-keyword">false</span>;
            <span class="hljs-keyword">else</span>                        <span class="hljs-comment">//找到第i-1个结点*p</span>
            {
                q=p->next;              <span class="hljs-comment">//q指向要删除的结点</span>
                <span class="hljs-keyword">if</span> (q==NULL) <span class="hljs-keyword">return</span> <span class="hljs-number">0</span>;  <span class="hljs-comment">//不存在第i个结点</span>
                e=q->data;
                p->next=q->next;        <span class="hljs-comment">//从单链表中删除*q结点</span>
                <span class="hljs-keyword">if</span> (p->next!=NULL) p->next->prior=p;
                <span class="hljs-built_in">free</span>(q);                <span class="hljs-comment">//释放*q结点</span>
                <span class="hljs-keyword">return</span> <span class="hljs-keyword">true</span>;
            }
        }
    }
    <span class="hljs-keyword">else</span>
        <span class="hljs-keyword">return</span> <span class="hljs-keyword">false</span>;   <span class="hljs-comment">//原双链表为空表时</span>
}</code>
源文件 main.cpp
#include "dlinklist.h"  
void Insert(CDLinkList *&ha, CDLinkList *&hb,int i)  
{  
    CDLinkList *p=ha->next,*q;  
    int lena=1,j=1;  
    while (p->next!=ha) //求出ha的长度lena  
    {  
        lena++;  
        p=p->next;  
    }  
    if (i==0)   //将hb的所有数据结点插入到ha的头结点和第1个数据结点之间  
    {  
        p=hb->prior;        //p指向hb的最后一个结点/  
        p->next=ha->next;       //将*p链到ha的第1个数据结点前面  
        ha->next->prior=p;  
        ha->next=hb->next;  
        hb->next->prior=ha;     //将ha头结点与hb的第1个数据结点链起来  
    }  
    else if (i<lena)            //将hb插入到ha中间  
    {  
        p=ha->next;  
        while (j<i)         //在ha中查找第i个结点*p  
        {  
            j++;  
            p=p->next;  
        }  
        q=p->next;          //q指向*p结点的后继结点/  
        p->next=hb->next;       //hb->prior指向hb的最后一个结点  
        hb->next->prior=p;  
        hb->prior->next=q;  
        q->prior=hb->prior;  
    }  
    else                        //将hb链到ha之后  
    {  
        ha->prior->next=hb->next; //ha->prior指向ha的最后一个结点  
        hb->next->prior=ha->prior;  
        hb->prior->next=ha;  
        ha->prior=hb->prior;  
    }  
    free(hb);   //释放hb头结点  
}  
  
  
int main()  
{  
    CDLinkList *HA, *HB;  
    ElemType ha[]= {0, 1, 2, 3, 4, 5, 6, 7 ,8, 9};  
    InitList(HA);  
    CreateListF(HA, ha, 10);  
    ElemType hb[]= {100, 200, 300, 400, 500};  
    InitList(HB);  
    CreateListF(HB, hb, 5);  
    printf("HA: ");  
    DispList(HA);  
    printf("HB: ");  
    DispList(HB);  
    Insert(HA, HB, 0);  //将0改为其他值，多次运行程序完成测试  
    printf("new HA: ");  
    DispList(HA);  
    DestroyList(HA);  
    return 0;  
} 
 
 

 

<code class=" hljs vala"><code class=" hljs cpp">运行结果截图：<img src="https://img-blog.csdn.net/20160922105152540?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQv/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt="" /></code></code><pre class="prettyprint"> 
 

知识点总结：双链表算法库采用程序的多文件组织形式。
 

学习心得：不是很理解。

 

 


  

                

        

        

    

  


    

      

        

            

              
                
                  vip____
                
              
            

            

                关注
              
            

        

        

          
      

      









              

  



          




        



    





    



      

      

        
      

      





	

		评论	
	

	
	




  

    

      添加红包
      
    

    

      

        
        

          
          
        

        
请填写红包祝福语或标题

      

      

        
        

          
          个
        

        
红包个数最小为10个

      

      

        
        

          
          元
        

        
红包金额最低5元

      

      

        
        

          当前余额3.43元
          前往充值 >
        

      

      

        

          需支付：10.00元
        

        
        
      

    

  





  

    
    
  

  

    
    
  








  

    

      

        

          

            
            
成就一亿技术人!

          

          

        

        

          

          

            领取后你会自动成为博主和红包主的粉丝
            规则
          

        

      

      

        

          

            
              
            
            

              
hope_wisdom
 发出的红包
            

          

        

        

          

          

          

        

      

    

    

  



      
      

      
实付元

      
使用余额支付

      

        

          

            
            点击重新获取
          

        

        
扫码支付

      

      

        
          
            
          
          
        
      

      

        
        钱包余额
          0
          

            
            

              

                
抵扣说明：

                
 1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
 2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

              

            

          

      

      余额充值