Java、斐波那契数列遍历器

最新推荐文章于 2024-09-20 15:32:13 发布

Renaissance&复活

最新推荐文章于 2024-09-20 15:32:13 发布

阅读量159

点赞数

文章标签： java jvm

本文链接：https://blog.csdn.net/m0_62659797/article/details/126427553

版权

Java 迭代器斐波那契数列 BigInteger 算法

关键词由CSDN通过智能技术生成

package list;

import java.math.BigInteger;
import java.util.Iterator;

/**
 * @author: xyz
 * @create: 2022/8/19
 * @Description:
 * @FileName: Exercise24_13
 * @History:
 * @自定义内容：
 */
public class Exercise24_13 {
    public static void main(String[] args) {
        FibonacciIterator iterator = new FibonacciIterator(10_0000L);
        while (iterator.hasNext())
            System.out.print(iterator.next() + " ");
    }

    /** 斐波那契数列迭代器 */
    static class FibonacciIterator implements Iterator<BigInteger> {
        private BigInteger f0 = BigInteger.ZERO;
        private BigInteger f1 = BigInteger.ONE;
        private BigInteger currentValue = BigInteger.ZERO;  //当前值
        private BigInteger maxValue;    //最大值
        private int nextIndex;      //索引

        public FibonacciIterator(long maxValue) {
            this.maxValue = BigInteger.valueOf(maxValue);
        }

        @Override
        public boolean hasNext() {
            currentValue = fab();
            return currentValue.compareTo(maxValue) <= 0;
        }

        @Override
        public BigInteger next() {
            nextIndex++;
            return currentValue;
        }

        /** 返回斐波那契数 */
        private BigInteger fab() {
            if (nextIndex == 0) currentValue = f0;
            else if (nextIndex == 1 || nextIndex == 2) currentValue = f1;
            else {
                f0 = f1;
                f1 = currentValue;
                currentValue = f0.add(f1);
            }

            return currentValue;
        }
    }
}