Всем привет!
Нужна помощь , помогите оптимизировать пожалуйста.
Короче нужен Code Review и ваши советы по оптимизации.
В консоль получаю следующее:
[1, 2, 3, 4, 5, 6, 7, 8, 9, 153, 370, 371, 407]
memory 650
time = 0
[1, 2, 3, 4, 5, 6, 7, 8, 9, 153, 370, 371, 407, 1634, 8208, 9474, 54748, 92727, 93084, 548834]
memory 975
time = 1package com.javarush.task.task20.task2025;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
/*
Алгоритмы-числа
*/
public class Solution {
public static long[] getNumbers(long N) {
ArrayDeque<Long> arrayDeque = new ArrayDeque<>();
ArrayList<Long> resultLong = new ArrayList<>();
Long[] resultLongM;
long[] result = null;
for (long i = 1; i <= N; i++) {
long n = i;
long temp = i;
//vichislenie kolichestva chisel v chisle
long zahl;
arrayDeque.clear();
while (temp != 0) {
zahl = temp % 10;
arrayDeque.addFirst(zahl);
temp /= 10;
}
long k = 0;
int size = arrayDeque.size();
for (Long aLong : arrayDeque) {
k = k + (long) Math.pow(aLong, size);
}
if (n == k) {
resultLong.add(i);
}
}
if (!resultLong.isEmpty()) {
resultLongM = resultLong.toArray(new Long[0]);
result = new long[resultLongM.length];
for (int i = 0; i < result.length; i++) {
result[i] = resultLongM[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);
}
}