static IEnumerable<int> Fibs(int count) { for (int i = 0,prevFib=1,curFib=1; i < count; i++) { yield return prevFib; int newFib = prevFib + curFib; prevFib = curFib; curFib = newFib; } }
C#迭代器实现斐波那契数列
原文：https://www.cnblogs.com/aqgy12138/p/12642189.html
