Вывод:
[1, 2, 3, 4, 5, 6, 7, 8, 9, 153, 370, 371, 407]
memory 322
time = 0
[1, 2, 3, 4, 5, 6, 7, 8, 9, 153, 370, 371, 407, 1634, 8208, 9474, 54748, 92727, 93084, 548834]
memory 13236
time = 0
package com.javarush.task.task20.task2025;
import java.math.BigDecimal;
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> resultList = new ArrayList<>();
for (long i = 1; i < N; i++) {
String number = String.valueOf(i);
char[] chars = number.toCharArray();
int numberLength = chars.length;
int count = 1;
List<Integer> numbersList = new ArrayList<>();
for (int j = 0; j < chars.length; j++) {
for (int k = 0; k < numberLength; k++) {
count = count * Integer.parseInt(String.valueOf(chars[j]));
}
numbersList.add(count);
count = 1;
}
int S = 0;
for (int integer : numbersList) {
S += integer;
}
if (S == i)
resultList.add(i);
}
Collections.sort(resultList);
long[] result = new long[resultList.size()];
for (int i = 0; i < resultList.size(); i++) {
result[i] = resultList.get(i);
}
return result;
}
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);
}
}