首页 > 编程语言 > 详细

Python实现斐波那契数列

时间:2019-12-03 02:19:42      阅读:97      评论:0      收藏:0      [点我收藏+]

1、最普通的写法

def fibonaci(num):
    a = 0
    b = 1
    print(a, end=" ")
    for _ in range(num):
        c = a + b
        a = b
        b = c
        print(a, end=" ")

fibonaci(10)

2、Python风格的写法

def fibonaci(num):
    a = 0
    b = 1
    print(a, end=" ")
    for _ in range(num):
        a, b = b, a+b
        print(a, end=" ")

fibonaci(10)

3、Python的迭代器实现

class Fibonacci:
    def __init__(self, max_num):
        self.max_num = max_num
        self.current_num = 0
        self.first_num = 0
        self.second_num = 1

    def __iter__(self):
        return self

    def __next__(self):
        if self.current_num < self.max_num:
            result = self.first_num
            self.first_num, self.second_num = self.second_num, self.first_num + self.second_num
            self.current_num += 1
            return result
        else:
            raise StopIteration


# 创建斐波那契额对象
f = Fibonacci(10)
for i in f:
    print(i, end= )

 

Python实现斐波那契数列

原文:https://www.cnblogs.com/zhirou/p/11973629.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!