Prove safety Offer: jump stairs

A. Title Description

A frog can jump on a Class 1 level, you can also hop on level 2. The frog jumped seeking a total of n grade level how many jumps (the order of different calculation different results).

 

II. Answers

f(n) = 0 (n = 0)

         1 (n = 1)

         2 (n = 2)

         f(n - 1) + f(n - 2)

 

III. Code

1. Recursion

int jump(int n)
{
  if (n == 0)
    return 0;
  if (n == 1)
    return 1;
  if (n == 2)
    return 2;
  return jump(n - 1) + jump(n - 2); 
}

 

 

2. Non-recursive

int jumpFloor(int number){

        int former1 = 1;
        int former2 = 2;
        int target = 0;

        if (number == 0)
            return 0;
        if (number == 1)
            return 1;
        if (number == 2)
        {
            return 2;

        }else{
            for (int i = 3; i <= number; i++)
            {
                target = former1 + former2;
                former1 = former2;
                former2 = target;
            }
        }

        printf("%d", target);
        return target;
  }

 

 

Congratulations to you by this title

Running time: 617ms

Take up memory: 504k