fib_by_stack.cpp

来自「斐波那契数列」· C++ 代码 · 共 21 行

#include <iostream>
#include "declare.h"
int fib_by_stack(int n)
{
	int x;
	PSeqStack pastack;
	pastack=createEmptyStack_seq(n+1);
	if(n>=0)
		push_seq(pastack,0);
	if(n>=1)
		push_seq(pastack,1);
	if(n>=2)
	{
		for(;pastack->t<n;)
		{
			x=pastack->s[pastack->t]+pastack->s[pastack->t-1];
			push_seq(pastack,x);
		}
	}
	return pastack->s[pastack->t];
}