function commonParentNode(oNode1,oNode2) {
if(oNode1.contains(oNode2)) {
return oNode1;
}
oNode1 = oNode1.parentNode;
}
//递归写法
function commonParentNode(oNode1,oNode2) {
if(oNode1.contains(oNode2)) {
return oNode1;
}
return commonParentNode(oNode1.parentNode,oNode2);
}
查找两个节点的公共父节点
最新推荐文章于 2023-09-03 01:41:54 发布