剑指offer - 矩形覆盖

public class Solution {    public int RectCover(int target) {        int []a=new int[101];            a[1]=1;            a[2]=2;        for (int i = 3; i < a.length; i++) {            a[i]=a[i-1]+a[i-2];        }        return a[target];    }}