<pre class="shiki github-dark shaku"><code>/** * @param {HTMLElement} rootA * @param {HTMLElement} rootB - rootA and rootB are clone of each other * @param {HTMLElement} nodeA */function findCorrespondingNode(rootA, rootB, target) { if (rootA === target) return rootB; // 步骤1：从 target 向上回溯到 rootA，记录每一层的索引 const path = []; let node = target; while (node !== rootA) { const parent = node.parentElement; // 使用 children 确保只考虑元素节点，索引与后续重放时一致 const index = Array.from(parent.children).indexOf(node); path.push(index); node = parent; } // 步骤2：在 rootB 上反向重放路径 let result = rootB; for (let i = path.length - 1; i &gt;= 0; i--) { result = result.children[path[i]]; } return result;}</code></pre>