矩形覆盖

本题实质是斐波拉契数列，类似问题——跳台阶、斐波拉契数列

/**
* 解法一——递归解法
*
*/
public class Solution {

public static void main(String[] args) {
Solution solution = new Solution();
System.out.print("请输入n的值：");
@SuppressWarnings("resource")
Scanner in = new Scanner(System.in);
int n = in.nextInt();
System.out.println("组合方法：" + solution.RectCover(n));

}

public int RectCover(int target) {
return (target <= 2) ? target : RectCover(target - 1) + RectCover(target - 2);
}
}

/**
* 解法一——一般循环解法
*
*/
public class Solution {

public static void main(String[] args) {
Solution solution = new Solution();
System.out.print("请输入n的值：");
@SuppressWarnings("resource")
Scanner in = new Scanner(System.in);
int n = in.nextInt();
System.out.println("组合方法：" + solution.RectCover(n));

}

public int RectCover(int target) {
int a = 1;
int b = 2;
int result = 0;

if(target == 1) {
result = 1;
} else if(target == 2) {
result =2;
} else {
for(int i = 0; i < target - 2; i++) {
result = a + b;
a = b;
b = result;
}
}

return result;
}
}