1137. N-th Tribonacci Number

最新推荐文章于 2023-12-06 10:10:22 发布

onefanyf

最新推荐文章于 2023-12-06 10:10:22 发布

阅读量83

点赞数 1

分类专栏： leetcode

本文链接：https://blog.csdn.net/qq_34471804/article/details/102473000

版权

leetcode 专栏收录该内容

77 篇文章 0 订阅

订阅专栏

#1137. N-th Tribonacci Number

The Tribonacci sequence Tn is defined as follows:
T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0.
Given n, return the value of Tn.

/**
 * @param {number} n
 * @return {number}
 */
var tribonacci = function(n) {
  return getTrib(n,[]);  
};

function getTrib(num,res) {
    if(num == 0) {
        return 0;
    }
    if(num == 1 || num == 2) {
        return 1;
    }
    if(res[num] == null) {
        res[num] = getTrib(num-1, res) + getTrib(num-2,res) + getTrib(num-3,res); 
    }
    
    return res[num];
}