用for循环\递归写斐波那契数列

for循环

public class Test{
	public static int fib(int n){
	if(n == 1 || n == 2){
		return 1;
		}else{
		int a = 1;
		int b = 1;
		int s = 0;
		for(int i = 2;i<n;i++){
			s = a + b;
			a = b;
			b = s;
			}
			return s;
		}
	}
	public static void main (String[] args){
	int result = fib(5);
	System.out.println(result);
	}
}

递归

public class Test2{
	public static int fib(int n){
	if(n == 1 || n == 2){
		return 1;
		}else{
		return fib(n-1)+fib(n-2);
		}
	}
	public static void main (String[] args){
	int result = fib(3);
	System.out.println(result);
	}
}

猜你喜欢

转载自blog.csdn.net/classics_moon/article/details/85115401