fibonacci With Memoization

package com.telerikacademy.tasks.Recursion;

import java.util.ArrayList;
import java.util.List;

public class Fibonacci {
    public static void main(String[] args) {

        int number = 25;

        List<Integer> listOfFibonacciNumbers = new ArrayList<>();
        listOfFibonacciNumbers.add(0);
        listOfFibonacciNumbers.add(1);
        listOfFibonacciNumbers.add(1);

        System.out.println(fibonacciWithMemoization(number, listOfFibonacciNumbers));
        for (int num : listOfFibonacciNumbers) {
            System.out.print(num + ", ");
        }
    }

    private static int fibonacciWithMemoization(int i, List<Integer> result) {
        if (i < result.size()) {
            return result.get(i);
        }
        int number = fibonacciWithMemoization(i - 1, result) + fibonacciWithMemoization(i - 2, result);
        result.add(number);
        return result.get(i);
    }
}