循环链表

最新推荐文章于 2025-09-11 18:44:42 发布

转载最新推荐文章于 2025-09-11 18:44:42 发布 · 67 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/lxgeek/archive/2011/05/08/2040506.html

文章标签：

#数据结构与算法 #大数据

本文详细介绍了如何使用C++实现环形链表的插入操作，并通过代码实例展示了实现过程。

#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <string.h>
#include <stdlib.h>
#include <stdio.h>

using namespace std;

typedef struct ring
{
char a;
struct ring *flink;
struct ring *slink;
} ring;

ring* sring = NULL;
ring* hring = NULL; /* the first node */
ring* ering = NULL; /* the end node */
void ring_pushback( ring* r, int n )
{
static int i = 0;

if ( i == 0 )
{
sring = r;
++i;
hring = r;
}
else
{
sring->slink = r;
r->flink = sring;

sring = r;

/* the end node */
if ( i == n - 1 )
{
sring->slink = hring;
hring->flink = sring;

ering = sring;
}

++i;
}

}

int main( void )
{
/*ofstream fout( "beads.out" );
ifstream fin( "beads.in" );*/

int n, i;
char temp;

cin >> n;

for ( i = 0; i < n; ++i )
{
cin >> temp;
//ring* bread = (ring*)malloc( sizeof( ring ) );
ring* bread = new ring;
bread->a = temp;
bread->flink = NULL;
bread->slink = NULL;

ring_pushback( bread, n );
}

ring* p = NULL;
ring* q = NULL;

p = hring;
do
{
cout << p->a << endl;
q = p;
p = p->slink;

delete q;
}while( p != hring );

}

转载于:https://www.cnblogs.com/lxgeek/archive/2011/05/08/2040506.html