一个有无限层间接引用的循环链表

yk__peng

于 2013-04-19 11:15:51 发布

阅读量644

点赞数

分类专栏： C/C++

C/C++ 专栏收录该内容

101 篇文章

订阅专栏

本文通过一个具体的C语言示例介绍了如何使用结构体定义并初始化循环列表，进而展示如何遍历该列表并输出对应的数值与后缀。这种方法适用于需要周期性重复数据结构的场景。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

/*Would run forever if you didn't limit it to MAX */
#include<stdio.h>
struct circ_list{
	char value[ 3 ]; 
	struct circ_list* next;
}; 
struct circ_list suffixes[ ] = 
{
	"th" , &suffixes[ 1 ], //0th 
	"st" , &suffixes[ 2 ], //1st
	"nd" , &suffixes[ 3 ], //2nd
	"rd" , &suffixes[ 4 ], //3rd
	"th" , &suffixes[ 5 ], //4th
	"th" , &suffixes[ 6 ], //5th
	"th" , &suffixes[ 7 ], //6th
	"th" , &suffixes[ 8 ], //7th
	"th" , &suffixes[ 9 ], //8th
	"th" , &suffixes[ 0 ], //9th
};




# define MAX 20
int main()
{
	int i = 0;
	struct circ_list *p = suffixes;
	while (i <=MAX) 
	{
		printf("%d%s\n", i, p->value);
		++i;
		p = p->next; 
	}
	return 0;
}