Abnormal jumping steps (recursive algorithm)

Source: Internet
Author: User

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)

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.