Question

我无法替换包含x递归调用的for循环。代码是关于在已知该数字的素因子时生成给定数的适当除数。该算法取自here，在图像中描绘。这是我的代码用于演示目的，它是可运行的：

Stream

它产生的输出是：

public class Demo {

    private static void generateDivisorsTraditional(int start, long lastFactor, Multiset<Long> primeFactors, Set<Long> divisors) {
        for (int i = start; i < primeFactors.elementSet().size(); i++) {
            long prime = Iterables.get(primeFactors.elementSet(), i);
            int count = primeFactors.count(prime);
            ++start;

            for (int c = 0; c <= count; c++) {
                long factor = ArithmeticUtils.pow(prime, c);
                divisors.add(lastFactor * factor);
                generateDivisorsTraditional(start, lastFactor * factor, primeFactors, divisors);
            }
        }
    }

    private static void generateDivisorsStream(int start, long lastFactor, Multiset<Long> primeFactors, Set<Long> divisors) {
        IntStream.range(start, primeFactors.elementSet().size())
                .forEach((int i) -> {
                    long prime = Iterables.get(primeFactors.elementSet(), i);
                    int count = primeFactors.count(prime);
                    final int begin = start + 1;

                    IntStream.range(0, count + 1)
                            .forEach((int c) -> {
                                long factor = ArithmeticUtils.pow(prime, c);
                                divisors.add(lastFactor * factor);
                                generateDivisorsStream(begin, lastFactor * factor, primeFactors, divisors);
                            });
                });
    }

    private static void testTraditional(Multiset<Long> primeFactors) {
        Set<Long> divisors = new TreeSet<>();
        generateDivisorsTraditional(0, 1, primeFactors, divisors);
        System.out.println("Traditional=> " + divisors);
    }

    private static void testStream(Multiset<Long> primeFactors) {
        Set<Long> divisors = new TreeSet<>();
        generateDivisorsStream(0, 1, primeFactors, divisors);
        System.out.println("Stream=> " + divisors);
    }

    private static void testStream1(Multiset<Long> primeFactors) {
        Set<Long> divisors = new TreeSet<>();
        new Inner().generateDivisorsStream(1, primeFactors, divisors);
        System.out.println("Stream1=> " + divisors);
    }

    public static void main(String[] args) {
        System.out.println("Test number: 10");
        Multiset<Long> primeFactors = TreeMultiset.create();
        primeFactors.add(2L);
        primeFactors.add(5L);

        testTraditional(primeFactors);
        testStream(primeFactors);
        testStream1(primeFactors);

        System.out.println();

        System.out.println("Test number: 90");
        primeFactors = TreeMultiset.create();
        primeFactors.add(2L);
        primeFactors.add(3L);
        primeFactors.add(3L);
        primeFactors.add(5L);

        testTraditional(primeFactors);
        testStream(primeFactors);
        testStream1(primeFactors);
    }

    private static class Inner {
        private int start = 0;

        private void generateDivisorsStream(long lastFactor, Multiset<Long> primeFactors, Set<Long> divisors) {
            IntStream.range(start, primeFactors.elementSet().size())
                    .forEach((int i) -> {
                        long prime = Iterables.get(primeFactors.elementSet(), i);
                        int count = primeFactors.count(prime);
                        ++start;

                        IntStream.range(0, count + 1)
                                .forEach((int c) -> {
                                    long factor = ArithmeticUtils.pow(prime, c);
                                    divisors.add(lastFactor * factor);
                                    generateDivisorsStream(lastFactor * factor, primeFactors, divisors);
                                });
                    });
        }
    }
}

顾名思义，方法Test number: 10 Traditional=> [1, 2, 5, 10] Stream=> [1, 2, 5, 10, 25] Stream1=> [1, 2, 5] Test number: 90 Traditional=> [1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90] Stream=> [1, 2, 3, 5, 6, 9, 10, 15, 18, 25, 27, 30, 45, 50, 75, 81, 90, 125, 135, 225, 405] Stream1=> [1, 2, 3, 5, 9]使用传统的for循环，并且我在其中对同一方法进行递归调用。方法generateDivisorsTraditional使用generateDivisorsStream来模仿for循环。

我怀疑IntStream.range()和++start;的{{1}}和final int begin = start + 1;的说明分别有所不同。我也尝试在generateDivisorsTraditional中使用generateDivisorsStream而不是final int begin = start + 1;，并且发现它已经开始生成错误的结果。我在内部类++start;中还有另一个变体，它也产生了错误的输出。

我想知道为什么这不符合行为的假设？我犯了什么错误？

Answer 1

我认为有一些错误：

private static void generateDivisorsTraditional(int start, long lastFactor, Multiset<Long> primeFactors, Set<Long> divisors) {
    for (int i = start; i < primeFactors.elementSet().size(); i++) {
        long prime = Iterables.get(primeFactors.elementSet(), i);
        int count = primeFactors.count(prime);
        // ++start; remove it

        for (int c = 0; c <= count; c++) {
            long factor = ArithmeticUtils.pow(prime, c);
            divisors.add(lastFactor * factor);
            generateDivisorsTraditional(i+1, lastFactor * factor, primeFactors, divisors); // replaced start -> i+1
        }
    }
}

private static void generateDivisorsStream(int start, long lastFactor, Multiset<Long> primeFactors, Set<Long> divisors) {
    IntStream.range(start, primeFactors.elementSet().size())
            .forEach((int i) -> {
                long prime = Iterables.get(primeFactors.elementSet(), i);
                int count = primeFactors.count(prime);
                IntStream.range(0, count + 1)
                        .forEach((int c) -> {
                            long factor = ArithmeticUtils.pow(prime, c);
                            divisors.add(lastFactor * factor);
                            generateDivisorsStream(i+1, lastFactor * factor, primeFactors, divisors);
                        });
            });
}

public static void main(String[] args) {
    Multiset<Long> m = HashMultiset.create();
    m.add(1L, 1);
    m.add(2L, 1);
    m.add(5L, 1);
    Set<Long> divisors = new HashSet<>();
    generateDivisorsTraditional(1, 1, m, divisors);
    System.out.println("Traditional=> "+divisors);
    divisors = new HashSet<>();
    generateDivisorsStream(1, 1, m, divisors);
    System.out.println("Stream=> "+divisors);
}

打印：

Traditional=> [1, 2, 5, 10]
Stream=> [1, 2, 5, 10]

用Stream替换for循环中的递归

1 个答案: