一旦条件满足,如何获取嵌套数组的id？

Question

我有一个嵌套数组,一旦条件满足,它应该给所有的父ID,例如我有一个数据数组,我应该匹配

• getParentIds(data,182,[]);
  • 结果:[96,182];
• getParentIds(data,174,[]);
  • 结果:[109,219,76,174];

var data = [{
  "id": 96,
  "name": "test1",
  "items": [{
    "id": 181,
    "name": "Yes",
    "items": []
  }, {
    "id": 182,
    "name": "No",
    "items": []
  }]
}, {
  "id": 109,
  "name": "Test5",
  "items": [{
    "id": 219,
    "name": "opt2",
    "items": [{
      "id": 76,
      "name": "test3",
      "items": [{
        "id": 173,
        "name": "Yes",
        "items": []
      }, {
        "id": 174,
        "name": "No",
        "items": [{
          "id": 100,
          "name": "test2",
          "items": [{
            "id": 189,
            "name": "Yes",
            "items": []
          }]
        }]
      }]
    }]
  }, {
    "id": 224,
    "name": "opt3",
    "items": []
  }]
}];


function getParentIds(data, id, parentIds) {
  if (!parentIds) {
    parentIds = [];
  }
  data.map(function(item) {
    if (item.id === id) {
      parentIds.push(item.id);
      return parentIds;
    } else if (item.items.length === 0) {
      // do nothing
    } else {
      return getParentIds(item.items, id, parentIds);
    }
  });
}

console.log("Array list: " + getParentIds(data, 182, []));

你能给我任何建议吗？

Answer 1

这是一个很酷的问题。我花了比我预期更多的时间来解决这个问题，但这是一个广度优先搜索实现：

var data = [{
  "id": 96,
  "name": "test1",
  "items": [{
    "id": 181,
    "name": "Yes",
    "items": []
  }, {
    "id": 182,
    "name": "No",
    "items": []
  }]
}, {
  "id": 109,
  "name": "Test5",
  "items": [{
    "id": 219,
    "name": "opt2",
    "items": [{
      "id": 76,
      "name": "test3",
      "items": [{
        "id": 173,
        "name": "Yes",
        "items": []
      }, {
        "id": 174,
        "name": "No",
        "items": [{
          "id": 100,
          "name": "test2",
          "items": [{
            "id": 189,
            "name": "Yes",
            "items": []
          }]
        }]
      }]
    }]
  }, {
    "id": 224,
    "name": "opt3",
    "items": []
  }]
}];


function parentsOf( arr, id, parents){
    if (parents.length)
        return parents;
    // I use for(;;) instead of map() because I need the return to exit the loop
    for (var i = 0; i < arr.length; i++){
        if ( arr[i].id == id){
             //push the current element at the front of the parents array
             parents.unshift( arr[i].id );
             return parents;
        };
        if ( arr[i].items ){
            parents = parentsOf(arr[i].items, id, parents);
            // if the parents array has any elements in it it means we found the child
            if (parents.length){
                parents.unshift(arr[i].id);
                return parents;
            }
        }
    }
    return parents;
}

console.log("Array list for 182: " + parentsOf(data, 182, []));
console.log("Array list for 174: " + parentsOf(data, 174, []));