def fib(max): n=0 b=1 a=b while n<max: if n<=1: print(b) n=n+1 else: temp=a a=b b=a+temp print(b) n=n+1 return 'done' print(fib(6))
Sign in to make a reply
姚树为
def fib(max): n=0 b=1 a=b while n<max: if n<=1: print(b) n=n+1 else: temp=a a=b b=a+temp print(b) n=n+1 return 'done' print(fib(6))