1.递归算法    求斐波那契数列中的某个数
import java.util.scanner;public class diguisuanfa { public static void main(string[] args) { scanner sc = new scanner(system.in); int a=sc.nextint(); system.out.println(getnum(a));} public static int getnum(int n ) { if(n<1) { system.out.println("输入不合法"); return 0; } if(n==1|n==2) { return 1; }else { return getnum(n-2)+getnum(n-1); } }}
2.斐波那契数列 求和
package csdn;import java.util.scanner;public class diguisuanfa { static int sum=0; public static void main(string[] args) { scanner sc = new scanner(system.in); int a=sc.nextint(); for(int i=1;i<=a;i++) { sum+=getnum(i); } system.out.println(sum);} public static int getnum(int n ) { if(n<1) { system.out.println("输入不合法"); return 0; } if(n==1|n==2) { return 1; }else { return getnum(n-2)+getnum(n-1); } }}
3.求1~某个数之间所有整数的和
//求1~某个数之间所有整数的和public class qiuhe {static int sum=0;public static void main(string[] args) {scanner sc = new scanner(system.in);int n =sc.nextint();system.out.println(getnum(n));}public static int getnum(int n) {if(n==1) {return 1;}else if(n>=1){return n+getnum(n-1);}else {return getnum(n-1);}}}
以上就是java开发基础之实战小案例的详细内容。