• Skip to primary navigation
  • Skip to content
  • Skip to footer
zhicheng xie's demo blog
  • Quick-Start Guide

    Your Name

    I am an amazing person.

    • Somewhere

    N-th Tribonacci Number

    less than 1 minute read

    <-E 1137> N-th Tribonacci Number

    class Solution {
    public:
        int tribonacci(int n) {
            int f[38];
            f[0]=0;
            f[1]=1;
            f[2]=1;
            for (int i=3;i<=n;i++) {
                f[i]=f[i-1]+f[i-2]+f[i-3];
            }
            return f[n];
        }
    };
    

    Tags: Algorithms, C++, Leetcode

    Updated: December 25, 2020

    Share on

    Twitter Facebook LinkedIn
    Previous Next

    You may also enjoy

    Decode Ways

    less than 1 minute read

    <-M 91> Decode Ways

    Word Break

    less than 1 minute read

    <-H 139> Word Break

    Distinct Subsequences

    less than 1 minute read

    <-H 115> Distinct Subsequences

    Edit Distance

    less than 1 minute read

    <-H 72> Edit Distance

    • Follow:
    • Feed
    © 2023 zhicheng xie's blog. Powered by Jekyll & Minimal Mistakes.