题解 | #在二叉树中找到两个节点的最近公共祖先#

public class Solution { public int rectCover(int target) { return f(target);

}
public int f(int n){
    if(n < 1) return 0;
    if(n == 1) return 1;
    if(n == 2) return 2;
    return f(n-1) + f(n-2);
}

}