递归算法——农夫养牛之动归

/**
 * Created by Administrator on 14-5-15.
 */
public class NewCow_DP {
    public static void main(String[] args){
        int[] cows=new int[31];
        cows[1]=1;
        cows[2]=1;
        cows[3]=2;
        for(int i=4;i<=30;i++){
            cows[i]=cows[i-1]+cows[i-3];
        }
        for(int i=1;i<=30;i++)
            System.out.println(i+"年后有牛："+cows[i]);
    }
}