We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent c7a8b75 commit 9ef560aCopy full SHA for 9ef560a
Easy/N-th Tribonacci Number.java
@@ -1,10 +1,13 @@
1
class Solution {
2
public int tribonacci(int n) {
3
- int[] arr = new int[38];
4
- arr[1] = arr[2] = 1;
5
- for (int i = 3; i < 38; i++) {
6
- arr[i] = arr[i - 1] + arr[i - 2] + arr[i - 3];
+ if (n <= 2) {
+ return n == 0 ? 0 : 1;
7
}
8
- return arr[n];
+ int[] dp = new int[n + 1];
+ dp[1] = dp[2] = 1;
+ for (int i = 3; i <= n; i++) {
9
+ dp[i] = dp[i - 2] + dp[i - 1] + dp[i - 3];
10
+ }
11
+ return dp[n];
12
13
0 commit comments