python fibonacci 递推

def fib1(upper):
    f1,f2 = 0,1;
    while f2<upper:
        print f2,
        f1,f2 = f2,f1+f2


fib1(100)
print;


def fib2(upper):
    f1,f2=0,1;
    result = [];
    while f2<upper:
        result.append(f2);
        f1,f2=f2,f1+f2;
    return result;

ret = fib2(100)

output:

1 1 2 3 5 8 13 21 34 55 89
[1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89]