前端递归循环

filterOrg(orgCodes){
  let list=orgCodes || []
  let result=[];
  if(list.length>0){
    let nodes=this.$refs.orgCodeTree.getCheckedNodes()
    for (let j = 0; j <list.length ; j++) {
      let child=list[j]
      if(child.length==1){
        result.push(child[0])
      }else {
        this.getSelectedNode(child,nodes,result);
      }
    }
    return [...new Set(result)]
  }
  return result
},
getSelectedNode(child,nodes,result){
  for (let m = 0; m <child.length ; m++) {
    for (let i = 0; i <nodes.length ; i++) {
      if(child[m]==nodes[i].value){
        result.push(child[m])
        return false
      }
    }
  }
},