Abnormal jumping steps (recursive algorithm)

Progression of steps: 1,2,3,4,5,6 .....

The corresponding jumping method: 1,2,4,8,16,32 ....

The final conclusion is that when the N-Step step is 1, 2 、... N-Step, the method of jumping is as follows:

          | 1        , (n=0=    | 1        , (n=1 )          | 2*f (n-1), (n>=2)

 PackageSuanfati;/** Abnormal jumping steps * A frog can jump up to 1 steps at a time, or jump up to level 2 ... It can also jump on n levels. * Ask the frog to jump on an n-level step with a total number of hops. * Recursive algorithm*/ Public classHighfrogjump { Public Static intJumpfloorii (inttarget) {            if(Target < 0){            return-1; }Else if(target = = 0 | | target = = 1){            return1; }Else{            return2*jumpfloorii (target-1); }    }     Public Static voidMain (string[] args) {//TODO auto-generated Method StubSystem.out.println (Jumpfloorii (5));// -    }}

Abnormal jumping steps (recursive algorithm)