本文共 1041 字，大约阅读时间需要 3 分钟。

下面是优化后的代码描述：

const hasPathSum = function (root, targetSum) {    if (!root) {        return [];    }    const results = [];    const stack = [[root, root.val, [root.val]]];    while (stack.length > 0) {        const [currentNode, currentSum, path] = stack.pop();        if (currentNode.right) {            stack.push([currentNode.right, currentSum + currentNode.right.val, [...path, currentNode.right.val]]);        }        if (currentNode.left) {            stack.push([currentNode.left, currentSum + currentNode.left.val, [...path, currentNode.left.val]]);        }        if (!currentNode.left && !currentNode.right) {            if (currentSum === targetSum) {                results.push(path);            }        }    }    return results;};

代码解释：