g1101_1200.s1137_n_th_tribonacci_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-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g1101_1200.s1137_n_th_tribonacci_number;
// #Easy #Dynamic_Programming #Math #Memoization #Dynamic_Programming_I_Day_1
// #2022_03_09_Time_0_ms_(100.00%)_Space_41.3_MB_(10.42%)
public class Solution {
public int tribonacci(int n) {
if (n == 0) {
return 0;
} else if (n <= 2) {
return 1;
} else {
int tn = 0;
int tn1 = 1;
int tn2 = 1;
int tmp = 0;
for (int i = 3; i <= n; i++) {
tmp = tn + tn1 + tn2;
tn = tn1;
tn1 = tn2;
tn2 = tmp;
}
return tmp;
}
}
}