diff --git a/dynamic-programming/src/leetcode/editor/cn/NThTribonacciNumber.java b/dynamic-programming/src/leetcode/editor/cn/NThTribonacciNumber.java
new file mode 100644
index 0000000..5e42a69
--- /dev/null
+++ b/dynamic-programming/src/leetcode/editor/cn/NThTribonacciNumber.java
@@ -0,0 +1,62 @@
+//
泰波那契序列 Tn 定义如下:
+//
+//T0 = 0, T1 = 1, T2 = 1, 且在 n >= 0 的条件下 Tn+3 = Tn + Tn+1 + Tn+2
+//
+//给你整数 n
,请返回第 n 个泰波那契数 Tn 的值。
+//
+//
+//
+//示例 1:
+//
+//输入:n = 4
+//输出:4
+//解释:
+//T_3 = 0 + 1 + 1 = 2
+//T_4 = 1 + 1 + 2 = 4
+//
+//
+//示例 2:
+//
+//输入:n = 25
+//输出:1389537
+//
+//
+//
+//
+//提示:
+//
+//
+// 0 <= n <= 37
+// - 答案保证是一个 32 位整数,即
answer <= 2^31 - 1
。
+//
+//
+//Related Topics
记忆化搜索数学动态规划
👍 279👎 0
+package leetcode.editor.cn;
+
+// 1137:第 N 个泰波那契数
+public class NThTribonacciNumber {
+ public static void main(String[] args) {
+ Solution solution = new NThTribonacciNumber().new Solution();
+ // TO TEST
+ }
+
+ //leetcode submit region begin(Prohibit modification and deletion)
+ class Solution {
+ public int tribonacci(int n) {
+ if (n == 0) {
+ return 0;
+ } else if (n < 3) {
+ return 1;
+ }
+ int[] arr = new int[n + 1];
+ arr[1] = 1;
+ arr[2] = 1;
+ for (int i = 3; i <= n; i++) {
+ arr[i] = arr[i - 1] + arr[i - 2] + arr[i - 3];
+ }
+ return arr[n];
+ }
+ }
+//leetcode submit region end(Prohibit modification and deletion)
+
+}
diff --git a/dynamic-programming/src/leetcode/editor/cn/doc/content/NThTribonacciNumber.md b/dynamic-programming/src/leetcode/editor/cn/doc/content/NThTribonacciNumber.md
new file mode 100644
index 0000000..4809183
--- /dev/null
+++ b/dynamic-programming/src/leetcode/editor/cn/doc/content/NThTribonacciNumber.md
@@ -0,0 +1,33 @@
+泰波那契序列 Tn 定义如下:
+
+T0 = 0, T1 = 1, T2 = 1, 且在 n >= 0 的条件下 Tn+3 = Tn + Tn+1 + Tn+2
+
+给你整数 n
,请返回第 n 个泰波那契数 Tn 的值。
+
+
+
+示例 1:
+
+输入:n = 4
+输出:4
+解释:
+T_3 = 0 + 1 + 1 = 2
+T_4 = 1 + 1 + 2 = 4
+
+
+示例 2:
+
+输入:n = 25
+输出:1389537
+
+
+
+
+提示:
+
+
+ 0 <= n <= 37
+ - 答案保证是一个 32 位整数,即
answer <= 2^31 - 1
。
+
+
+Related Topics
记忆化搜索数学动态规划
👍 279👎 0
\ No newline at end of file