列表

详情


FED23. dom 节点查找

描述

查找两个节点的最近的一个共同父节点,可以包括节点自身

输入描述

oNode1 和 oNode2 在同一文档中,且不会为相同的节点

原站题解

HTML/CSS/JavaScript 解法, 执行用时: 841ms, 内存消耗: 77772KB, 提交时间: 2021-07-18

{"css":"","js":"function commonParentNode(oNode1, oNode2) {\n    while(true){\n        oNode1=oNode1.parentNode;\n        if(oNode1.contains(oNode2)){\n            return oNode1;\n        }\n    }\n}","html":"","libs":[]}

HTML/CSS/JavaScript 解法, 执行用时: 842ms, 内存消耗: 77900KB, 提交时间: 2021-03-21

{"css":"","js":"function commonParentNode(oNode1, oNode2) {\n    if(oNode1.contains(oNode2)) {\n        return oNode1\n    }else {\n        return commonParentNode(oNode1.parentNode, oNode2)\n    }\n}","html":"","libs":[]}

HTML/CSS/JavaScript 解法, 执行用时: 843ms, 内存消耗: 77744KB, 提交时间: 2021-04-30

{"css":"","js":"function commonParentNode(oNode1, oNode2) {\n\n    for(;oNode1;oNode1 = oNode1.parentNode) {\n        console.log(oNode1)\n        if (oNode1.contains(oNode2)) {\n            return oNode1\n        }\n    }\n}","html":"","libs":[]}

HTML/CSS/JavaScript 解法, 执行用时: 843ms, 内存消耗: 77780KB, 提交时间: 2021-02-26

{"css":"","js":"function commonParentNode(oNode1, oNode2) {\n     while(true){\n        oNode1 = oNode1.parentNode;\n        if(oNode1.contains(oNode2)){\n            return oNode1;\n            break;\n        }\n    }\n    \n}","html":"","libs":["jquery"]}

HTML/CSS/JavaScript 解法, 执行用时: 844ms, 内存消耗: 77760KB, 提交时间: 2021-04-25

{"css":"","js":"function commonParentNode(oNode1, oNode2) {\n    for(;oNode1;oNode1 = oNode1.parentNode) {\n        if(oNode1.contains(oNode2)) {\n            return oNode1\n        }\n    }\n}","html":"","libs":[]}

上一题