Climbing Stairs
发布时间：2020-12-14 03:47:07 所属栏目：大数据 来源：网络整理
导读：Summary You are climbing a stair case. It takes? n ?steps to reach to the top.? Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Solution We can use dynamic programming to solve this problem.
SummaryYou are climbing a stair case. It takes?n?steps to reach to the top.?Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? SolutionWe can use dynamic programming to solve this problem. Codeint climbStairs(int n) { ? ? ? ? if(n == 1){ ? ? ? ? ? ? return 1; ? ? ? ? } ? ? ? ? int dp[n + 1]; ? ? ? ? dp[1] = 1; ? ? ? ? dp[2] = 2; ? ? ? ?for(int i = 3; i <= n; i++){ ? ? ? ? ? dp[i] = dp[i - 1] + dp[i - 2]; ? ? ? ? } ? ? ? ? return dp[n]; ? }
（编辑：李大同） 【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容! |