兔子生兔子问题

package algorithm;

 

public class 兔子生兔子问题 {

/**

* 这是一个典型的斐波那契数列问题，2,3,5,8,13,21....

*/

public static int 斐波那契数列(int mouth) {

if (mouth == 0)

return 1;

if (mouth == 1)

return 1;

int a = 1;

int b = 1;

 

for (int i = 1; i <= mouth; i++) {

a = a + b;

b = a + b;

System.out.println(a + "  " + b);

}

return b;

}

 

public static void main(String[] args) {

斐波那契数列(12);

}

}