A child is running up a staircase with N steps, and can hop either 1 step,2steps,3 steps at a time. ...

 

A child is running up a staircase with N steps, and can hop either 1 step,2steps,3 steps at a time. Count how many possible ways the child can run up the stairs.

 

 class Upstaircase
    {
        static void Main(string[] args)
        {
            /* Enter your code here. Read input from STDIN. Print output to STDOUT */

            //string line1 = System.Console.ReadLine().Trim();

            System.Console.WriteLine(Upstaircase.countWaysDP(2,new int[100]));
            System.Console.WriteLine(Upstaircase.countWaysDP(3, new int[100]));
            System.Console.WriteLine(Upstaircase.countWaysDP(4, new int[100]));
            System.Console.WriteLine(Upstaircase.countWaysDP(5, new int[100]));
            System.Console.WriteLine(Upstaircase.countWaysDP(36, new int[100]));
            System.Console.WriteLine(Upstaircase.countWaysDP(38, new int[100]));
            Console.Read();

        }
      //O(3^n). exponential
        public static int countWays(int n)
        {
            if (n<0)
            {
                return 0;
            }
            else if (n==0)
            {
                return 1;
            }
            else
            {
                return countWays(n - 1) + countWays(n - 2) + countWays(n - 3);
            }

        }
        //DP: dynamic programing.   up to 37 will overflowed.  Using Long type is just delay but not resolve it.
        public static int countWaysDP(int n,int[] map)
        {
            if (n < 0)
            {
                return 0;
            }
            else if (n == 0)
            {
                return 1;
            }
            else if (map[n] > 0)
            {
                return map[n];
            }
            else
            {
                map[n] = countWaysDP(n - 1, map) + countWaysDP(n - 2,map) + countWaysDP(n - 3,map);
                return map[n];
            }

        }

  

转载于:https://www.cnblogs.com/anorthwolf/archive/2013/06/13/3133400.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值