数据结构：define实现链表

最新推荐文章于 2022-11-16 23:00:23 发布

让我们荡起双脚

最新推荐文章于 2022-11-16 23:00:23 发布

阅读量1k

点赞数 1

分类专栏：数据结构

本文链接：https://blog.csdn.net/liuhuiyan_2014/article/details/47418379

版权

数据结构专栏收录该内容

24 篇文章 0 订阅

订阅专栏

#include <iostream>
typedef int af[];
typedef struct Node
{
	struct Node *next;
	int data;
	Node(int d = int()) :next(NULL), data(d){}
}Node;
Node* first = NULL;

#define LIST(ar,n)         \
{                          \
Node *p = first;           \
for (int i = 0; i < n; i++)\
{	                       \
Node *s = new Node(ar[i]); \
if (p == NULL)             \
{                          \
first = s;                 \
p = first;                 \
}                          \
else                       \
{                          \
s->next = p->next;         \
p->next = s;               \
p = s;                     \
}                          \
}                          \
}                          \

#define PRINT()            \
{                          \
Node *p = first;           \
while (p != NULL)           \
{                         \
cout << p->data << " ";   \
p = p->next;              \
}                       \
}                        \

using namespace std;
int main()
{
	int a[] = { 1, 2, 3, 4 };
	LIST(a,sizeof(a)/sizeof(int));
	PRINT();
	return 0;
}