[1, 2, 3, 4, 5, 6, 7, 8, 9, 153, 370, 371, 407]
memory 666
time = 0
[1, 2, 3, 4, 5, 6, 7, 8, 9, 153, 370, 371, 407, 1634, 8208, 9474, 54748, 92727, 93084, 548834]
memory 915
time = 1
Process finished with exit code 0
package com.javarush.task.task20.task2025;
import java.util.Arrays;
import java.util.stream.LongStream;
/*
Алгоритмы-числа
*/
public class Solution {
public static long[] getNumbers(long N) {
return LongStream.range(1, N)
.filter(i -> {
long partNumber = i, powSum = 0;
int pow = (int) Math.log10(i) + 1;
for (; i != 0; i /= 10) powSum += Math.pow(i % 10, pow);
return (powSum == partNumber);
})
.toArray();
}
public static void main(String[] args) {
long a = System.currentTimeMillis();
System.out.println(Arrays.toString(getNumbers(1000)));
long b = System.currentTimeMillis();
System.out.println("memory " + (Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory()) / (8 * 1024));
System.out.println("time = " + (b - a) / 1000);
a = System.currentTimeMillis();
System.out.println(Arrays.toString(getNumbers(1000000)));
b = System.currentTimeMillis();
System.out.println("memory " + (Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory()) / (8 * 1024));
System.out.println("time = " + (b - a) / 1000);
}
}