Результат тот же что и в правильном решении. Только кода меньше.
package com.javarush.task.task20.task2025;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
/*
Алгоритмы-числа
*/
public class Solution {
public static long[] getNumbers(long N) {
List<Long> list = new ArrayList<>();
while (N > 1) {
N--;
char[] array = Long.toString(N).toCharArray();
int i = array.length;
long j = 0;
long sum = 0;
for (char ch : array) {
long m = 1;
j = Long.parseLong(Character.toString(ch));
for (int x = 0; x < i; x++) {
m = m * j;
}
sum = sum + m;
}
if (sum == N) {
list.add(N);
}
}
long[] result = new long[list.size()];
Collections.sort(list);
for (int i = 0; i < list.size(); i++) {
result[i] = list.get(i);
}
return result;
}
public static void main(String[] args) throws InterruptedException {
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);
}
}