<commit_before>package leetcode;

/**
 * https://leetcode.com/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/
 */
public class Problem1414 {
    public int findMinFibonacciNumbers(int k) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem1414 prob = new Problem1414();
        System.out.println(prob.findMinFibonacciNumbers(7)); // 2
        System.out.println(prob.findMinFibonacciNumbers(10)); // 2
        System.out.println(prob.findMinFibonacciNumbers(19)); // 3
    }
}<commit_msg>Update problem 1414<commit_after>package leetcode;

/**
 * https://leetcode.com/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/
 */
public class Problem1414 {
    public int findMinFibonacciNumbers(int k) {
        Integer[] memo = new Integer[k + 1];
        memo[1] = 1;
        memo[2] = 1;
        fibonacci(k, memo);
        int answer = Integer.MAX_VALUE;
        // TODO:
        return answer;
    }

    private static int fibonacci(int n, Integer[] memo) {
        if (n <= 2) {
            return 1;
        }
        if (memo[n] != null) {
            return memo[n];
        }
        memo[n] = fibonacci(n - 1, memo) + fibonacci(n - 2, memo);
        return memo[n];
    }

    public static void main(String[] args) {
        Problem1414 prob = new Problem1414();
        System.out.println(prob.findMinFibonacciNumbers(7)); // 2
        System.out.println(prob.findMinFibonacciNumbers(10)); // 2
        System.out.println(prob.findMinFibonacciNumbers(19)); // 3
    }
}
{'fraction_non_alphanumeric': 0.1375796178343949, 'fraction_numerical': 0.034394904458598725, 'mean_word_length': 2.3283898305084745, 'pattern_counts': {'":': 0, '<': 4, '<?xml version=': 0, '>': 3, 'https://': 2, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '7235460', 'n_tokens_mistral': 576, 'n_tokens_neox': 523, 'n_words': 98}