fig10_41.cpp

经典书籍源代码啊。。。第三版。。。数据结构与算法分析——C++描述(第3版).

/**
 * Compute Fibonacci numbers as described in Chapter 1.
 */
int fibonacci( int n )
{
    if( n <= 1 )
        return 1;

    int last = 1;
    int nextToLast = 1;
    int answer = 1;
    for( int i = 2; i <= n; i++ )
    {
        answer = last + nextToLast;
        nextToLast = last;
        last = answer;
    }
    return answer;
}