/** * @author sundf * @Date 3-14 */ public class SS { public static void main(String[] args) { Scanner scan = new Scanner(System.in); int n = scan.nextInt(); System.out.println(SS.f(n)); System.out.println("----------------------------------"); SS.method_one(); System.out.println("----------------------------------"); System.out.println(SS.f1(n)); System.out.println("----------------------------------"); System.out.println(SS.f2(n)); System.out.println("----------------------------------"); System.out.println(SS.f3(n)); } /** * 求1到n以内的斐波那契数 1,1,2,3,5,8,13,21... * @param n */ public static void method_one(){ int n=100; int a=0,b=1; while(b<n){ System.out.println(b); b=b+a; a=b-a; } } /** * 求第n个数 * 递归思想 */ public static int f(int n){ if(n<3) return 1; else return f(n-1)+f(n-2); } /** * 求1*1+2*2+...+n*n * 递归 * @param n * @return */ public static int f1(int n){ int sum=0; if(n>0) { sum = n*n+f1(n-1); } return sum; } /** * 求n! 阶乘 * @param n * @return */ public static int f2(int n){ int sum=1; if(n>1) sum = n*f2(n-1); return sum; } /** * 求1+2+3+4+...+n * @param n * @return */ public static int f3(int n){ int sum=0; if(n>0) sum = n+f3(n-1); return sum; } }