/*
设单链表的前二个结点值为均为1,
从第三个结点开始,结点值为前二个结点值之和,
试设计一个具有n(25>n>=3)个结点的单向链表,
并输出。
*/
# include <iostream>
# include <stdlib.h>
# include <stdio.h>
using namespace std;
const int maxn = 100;
typedef struct Node
{
int elem;
struct Node* next;
}*linklist;
int arr[maxn];
void fibonacci_number(int arr[maxn])
{
arr[1] = arr[2] = 1;
for(int i = 3; i<=maxn; i++)
{
arr[i] = arr[i-1] + arr[i-2];
}
}
void inlinklist(linklist &l, int n)
{
l = (linklist) malloc (sizeof(Node));
l->next = NULL;
linklist p, end;
end = l;
printf("请输入链表元素:\n");
for(int i = 0; i<n; i++)
{
p = (linklist) malloc(sizeof(Node));
p->elem = arr[i+1];
end->next = p;
p->next = NULL;
end = p;
}
}
void outlinklist(linklist l)
{
printf("链表中的元素为:\n");
linklist p;
p = l->next;
while(p)
{
printf("%d ", p->elem);
p = p->next;
}
printf("\n");
}
int main()
{
linklist l;
int n;
fibonacci_number(arr);
printf("请输入链表的元素个数:\n");
scanf("%d", &n);
inlinklist(l, n);
outlinklist(l);
return 0;
}