剑指offer--矩形覆盖

public class Solution {
    static int[] dp = new int[10000];

    public int RectCover(int target) {
        if ( target == 1){
            dp[target] = 1;
            return dp[target];
        }else if(target == 2){
            dp[target] = 2;
            return dp[target];
        }else{
            for ( int i = 3 ; i <= target ; i++){
                dp[i] = dp[i-1] + dp[i-2];
            }
            return dp[target];
        }
    }
}

class Solution {
    public:
        int data[100000];
        int rectCover(int number) {
            if(number == 1){
                data[number] = 1;
            }
            if(number == 2){
                data[number] = 2;
            }
            for(int i = 3 ; i <= number ; i++){
                data[i] = data[i-2]+data[i-1];
            }
            return data[number];
        }
};