劳斯说运行起来需要展现出来是用数组保存的
笨人看了很多例子有点看不懂😭好难
就是想问一下大家大概个框架是怎么样的
供参考：
#include <stdio.h>
#define N 100
typedef struct commodity{
char id[16]; // 商品编码
char name[32]; // 名称
int num; // 数量
float price; // 单价
}Wares;
int main()
{
int i;
Wares comm[N] = {{"123456789","哇哈哈瓶装水",50,2.50},// 定义商品数组,数组元素共 100 个
{"123456780","锅巴",10,4.56}};
printf("%-16s %-32s %-10s %-10s\n","商品编码","商品名称","数量","单价");
for (i = 0; i < 2; i++)
printf("%-16s %-32s %-10d %-10.2f\n",comm[i].id,comm[i].name,comm[i].num,comm[i].price);
return 0;
}
//先倒序存到一个新的链表中，然后输出
//采用头插法即可
void reverse_output(Node* head)
{
Node* reverse_first = (Node*)malloc(sizeof(Node));
assert(reverse_first);
reverse_first -> data = 0;
reverse_first -> next = NULL;
Node* p = head->next;
while(p)
{
Node* save = p;
p = p->next;
save->next = reverse_first->next;
reverse_first->next = save;
}
print_list(reverse_first);
}