无限递归

Question

我有以下代码：

public void generateTree(Node myNode) { 
    for(int i = 1; i <= 6; i++) { 
     //Creating child node 
     Node child = new Node(); 

     //Setting new Depth 
     child.setDepth(myNode.getDepth()+1); 

     //Adding node to tree 
     myTree.add(child); 

     //If the game isn't over and we're not reached the maximum depth, recurse 
     if(!isGameOver() && child.getDepth() < MAX_DEPTH) 
      generateTree(child); 
    } 
} 

在哪里基本上MAX_DEPTH是指示我想探索到的在游戏中移动一个树中的最大深度的整数，getDepth（）返回节点的深度作为参数提交，setDepth设置新节点的深度。

由于某些原因，它似乎会生成无限递归，但是......有什么建议吗？

Answer 1

你的问题不是无限递归。这可能是别的。此代码对我的作品 -

import java.util.ArrayList; 
import java.util.List; 


public class Node 
{ 

    private int depth; 

    public static final int MAX_DEPTH = 2; 

    private static List<Node> myTree = new ArrayList<Node>(); // for testing purposes 

    public void generateTree(Node myNode) { 
     for(int i = 1; i <= 6; i++) { 
      //Creating child node 
      Node child = new Node(); 

      //Setting new Depth 
      child.setDepth(myNode.getDepth()+1); 

      //Adding node to tree 
      myTree.add(child); 

      //If the game isn't over and we're not reached the maximum depth, recurse 
      if(child.getDepth() < MAX_DEPTH) 
       generateTree(child); 
     } 
    } 

    public static void main(String [] args) 
    { 
     Node node = new Node(); 

     Node myNode = new Node(); 
     myNode.setDepth(0); 

     node.generateTree(myNode); 

     System.out.println(myTree.size()); 

    } 

    public int getDepth() { 
     return depth; 
    } 

    public void setDepth(int depth) { 
     this.depth = depth; 
    } 

} 

我得到的输出是

42