Breaking News: Grepper is joining You.com. Read the official announcement!

fibonacci numbers - top down dp

Sumit Rawal answered on October 19, 2022 Popularity 1/10 Helpfulness 1/10

answer fibonacci numbers - top down dp

fibonacci numbers - top down dp

Comment

class Solution86
{
    //Function to find the nth fibonacci number using top-down approach.
    public long findNthFibonacci(int number, long dp[])
    { if (number == 0){
        dp [number]=0;
        return dp [number];
    }
    else if (number == 1){
        dp [number]=1;
        return dp [number];
    }
    else if (dp[number] != 0){
        return dp [number];
    }else {
        dp [number]=findNthFibonacci(number-1,dp)+findNthFibonacci(number-2,dp);
        return dp [number];
    }

    }

}

Popularity 1/10 Helpfulness 1/10 Language whatever

Source: Grepper

Tags: fibonacci numbers top-down whatever

Link to this answer
Share Copy Link

Contributed on Oct 19 2022

Sumit Rawal

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

fibonacci numbers - top down dp

Contents

More Related Answers

fibonacci numbers - top down dp

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.