public class CatalanNumbers {
private int howManyVariaties;
private int catalanNumber;
private int catalanNumber;
public int catalan(int a) {
if (Method was never executed with that input) {
howManyVariaties++;
int catalanNumber = 0;
for (int i= 0; i < n; i++) {
catalanNumber += catalan(i) * catalan( n- 1 -i);
return catalanNumber总而言之,我只想检查最大堆栈深度是多少。
有人能帮我吗?
发布于 2019-12-27 02:22:09
向您的类添加一个跟踪使用了哪些输入的集合,并在方法中检查该集合
public class CatalanNumbers {
private int howManyVariaties;
private int catalanNumber;
private int catalanNumber;
private Set<Integer> alreadyHandled = new HashSet<>();
public int catalan(int a) {
if (alreadyHandled.add(a)) {
//rest of code
}
}
//...
}https://stackoverflow.com/questions/59491951
复制相似问题