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.
publicstaticintstepPerms(intn){// Write your code hereif(n<=1){return1;}int[]arr=newint[n+1];arr[0]=1;arr[1]=1;arr[2]=2;for(inti=3;i<=n;i++){arr[i]=arr[i-1]+arr[i-2]+arr[i-3];}returnarr[n];}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Recursion: Davis' Staircase
You are viewing a single comment's thread. Return to all comments →
JAVA