g0501_0600.s0509_fibonacci_number.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation
Show all versions of leetcode-in-java Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
package g0501_0600.s0509_fibonacci_number;
// #Easy #Dynamic_Programming #Math #Recursion #Memoization #Dynamic_Programming_I_Day_1
// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming
// #2022_07_25_Time_0_ms_(100.00%)_Space_41.4_MB_(15.60%)
public class Solution {
private int[] memo = new int[31];
public int fib(int n) {
if (n == 0) {
return 0;
}
if (n == 1) {
return 1;
}
if (memo[n] != 0) {
return memo[n];
}
memo[n] = fib(n - 1) + fib(n - 2);
return memo[n];
}
}