Recursion: Davis' Staircase Discussions | | HackerRank
We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Recursion: Davis' Staircase
  2. Discussions

Recursion: Davis' Staircase

  • an_shuman777
     + 1 comment

    Recursion with memoization, Here is my CPP code :

    const int MAX = 50;
int dp[MAX];
int rec(int n){
    if(n==1){return dp[1]=1;}
    else if(n==2){return dp[2]=2;}
    else if(n==3){return dp[3]=4;}
    else if(dp[n]!=0){return dp[n];}
    else {return dp[n]=rec(n-1)+rec(n-2)+rec(n-3);}
}