剑指offer--矩形覆盖--简单DP

题目描述

我们可以用2*1的小矩形横着或者竖着去覆盖更大的矩形。请问用n个2*1的小矩形无重叠地覆盖一个2*n的大矩形，总共有多少种方法？

public static int dp[];public static void main(String[] args) {// TODO Auto-generated method stub}    public static int RectCover(int target) {        if (target==1) {return 1;}else if (target==2) {return 2;}else if (target==0) {return 0;}else {dp = new int[target+1]; dp[1] = 1;     dp[2] = 2;    for (int i = 3; i <= target; i++) {    dp[i] = dp[1] + dp[2];dp[1] = dp[2];dp[2] = dp[i];}    return dp[target];}        }