Java 递归阶乘,求1+2+3+4+5+6+7……+n的和,斐波拉契数列第n项值

最新推荐文章于 2025-05-21 10:10:48 发布

原创最新推荐文章于 2025-05-21 10:10:48 发布 · 4.4k 阅读

1 ·

CC 4.0 BY-SA版权

java基础专栏收录该内容

6 篇文章

订阅专栏

本文介绍并实现了三种递归算法：阶乘计算、累加求和及斐波那契数列生成。通过具体代码示例展示了递归算法的基本原理及其应用。

package com.wen;

import org.junit.Test;

/**
 * @author wencun
 * @date 2018年4月9日 上午10:45:23
 * @version 1.0
 * @since JDK 1.8
 */
public class DiGui {
     /**
     * 递归阶乘
     * @author wencun
     * @date: 2018年4月9日 上午10:52:59
     * @param n
     * @return
     */
    public static int jiecheng(int n) {
         if(n==1||n==0) {
            return n; 
         }
        return n*jiecheng(n-1);
         
     }
    
    /**
     * 求1+2+3+4+5+6+7……+n的和
     * @author wencun
     * @date: 2018年4月9日 上午10:59:44
     * @param n
     * @return
     */
    public static int leijia(int n) {
        if(n<1) {
            return n;  
        }
        return n+leijia(n-1);
        
    }
    
    /**
     * 斐波拉契数列n项值
     * @author wencun
     * @date: 2018年4月9日 上午11:08:39
     * @return
     */
    public static int feibolaqi(int n) {
        int first=0;
        int second=1;
        int third=0;
        for(int i=1;i<n;i++) {
            third=first+second;
            first=second;
            System.out.println(second);
            second=third;
        }
        return third;
        
    }
     
     @Test
    public void jiecheng() throws Exception {
        int jiecheng = DiGui.jiecheng(5);
        System.out.println(jiecheng);
    }
     
     @Test
    public void leijia() throws Exception {
        int leijia = leijia(5);
        System.out.println(leijia);
    }
     
     @Test
    public void feibolaqi() throws Exception {
         int feibolaqi = feibolaqi(10);
         System.out.println(feibolaqi);
    }
     
     
}

Detect languageAfrikaansAlbanianArabicArmenianAzerbaijaniBasqueBelarusianBengaliBosnianBulgarianCatalanCebuanoChichewaChinese (Simplified)Chinese (Traditional)CroatianCzechDanishDutchEnglishEsperantoEstonianFilipinoFinnishFrenchGalicianGeorgianGermanGreekGujaratiHaitian CreoleHausaHebrewHindiHmongHungarianIcelandicIgboIndonesianIrishItalianJapaneseJavaneseKannadaKazakhKhmerKoreanLaoLatinLatvianLithuanianMacedonianMalagasyMalayMalayalamMalteseMaoriMarathiMongolianMyanmar (Burmese)NepaliNorwegianPersianPolishPortuguesePunjabiRomanianRussianSerbianSesothoSinhalaSlovakSlovenianSomaliSpanishSundaneseSwahiliSwedishTajikTamilTeluguThaiTurkishUkrainianUrduUzbekVietnameseWelshYiddishYorubaZulu

AfrikaansAlbanianArabicArmenianAzerbaijaniBasqueBelarusianBengaliBosnianBulgarianCatalanCebuanoChichewaChinese (Simplified)Chinese (Traditional)CroatianCzechDanishDutchEnglishEsperantoEstonianFilipinoFinnishFrenchGalicianGeorgianGermanGreekGujaratiHaitian CreoleHausaHebrewHindiHmongHungarianIcelandicIgboIndonesianIrishItalianJapaneseJavaneseKannadaKazakhKhmerKoreanLaoLatinLatvianLithuanianMacedonianMalagasyMalayMalayalamMalteseMaoriMarathiMongolianMyanmar (Burmese)NepaliNorwegianPersianPolishPortuguesePunjabiRomanianRussianSerbianSesothoSinhalaSlovakSlovenianSomaliSpanishSundaneseSwahiliSwedishTajikTamilTeluguThaiTurkishUkrainianUrduUzbekVietnameseWelshYiddishYorubaZulu

Text-to-speech function is limited to 200 characters

Options : History : Feedback : Donate