package cn.mathMethod;
/*
* 牛的规律为数列1,1,2,3,5,8,13,21....
*
*/
public class fabonach {
public static void main(String[] args) {
// TODO Auto-generated method stub
int n = 8;
int sum = add(n);
System.out.println(sum);
}
private static int add(int n) {
if(n<=0) return 0;
//小于三年就只有一头牛
if(n<3 & 0<n)
return 1;
int sums = 0;
//新增的牛为以前的牛每个月所产牛
sums+= add(n-1)+add(n-2);
return sums;
}
}
|