list清空问题？调用clear()、removeAll()、以及迭代删除 都不行!!

Question

//递归程序
public class DgDemo {

@Test
public void test(){
    //id,name,pid,pids,pidsName
    //ID,名称，父ID，所有父ID，所有父ID名称
    Node node = new Node("1", "DG1", "2", "", ""); //node 与node2互为父子关系，为错误数据
    Node node2 = new Node("2", "DG2", "1", "", "");
    Node node22 = new Node("0", "DG0", "3", "", "");
    Node node3 = new Node("3", "DG3", "4", "", "");
    Node node4 = new Node("4", "DG4", "5", "", "");
    List<Node> nodes2 = new ArrayList<>();
    nodes2.add(node22);
    nodes2.add(node3);
    nodes2.add(node);
    nodes2.add(node2);
    nodes2.add(node4);
    //上述add顺序 则是可以得到我要结果 若将node2和node4互换位置后。结果是错了的，递归node2应该返回[]  但是我使用list的清空方法。但是没清到
    for (Node n : nodes2) {
        System.out.println("id:"+n.getId());
        List<Node> childMenu = new DgDemo().getParentId(nodes2,n.getId());
        System.out.println("childMenu:"+childMenu);
    }
}

private List<Node> childMenu = new ArrayList<Node>();
//设置count是防止错误数据无限循环。抛出堆栈溢出异常 终止程序
private int count = 0;

public List<Node> getParentId(final List<Node> nodes, String id) {
    System.out.println(count);
    if (nodes != null && nodes.size() != 0) {
        for (Node node : nodes) {
            if (count > 15) {

// childMenu.removeAll(childMenu);
// childMenu.clear();
Iterator it = childMenu.iterator();

while (it.hasNext()) {
it.next();
it.remove();
}
continue;
}else if (node.getId().equals(id) && count <= 15) {
if (node.getParentId().equals(node.getId())) {
childMenu.add(node);
} else if (null != node.getParentId() && !node.getParentId().equals(node.getId())) {
count++;
getParentId(nodes, node.getParentId());
childMenu.add(node);
} else {
continue;
}
}else {
continue;
}
}
}
return childMenu;
}

}

//求教大神

Answer 1

Node这个类没贴出来