递归更新树形结构中指定节点及其父节点的数值（排除根节点）

const data = [
  {
    key: "id1",
    name: "Category 1",
    curr: 0,
    total: 0,
    nodes: [
      {
        key: "id2",
        name: "Applications",
        curr: 20,
        total: 30,
        nodes: [
          {
            key: "id3",
            name: "Gaming",
            curr: 5,
            total: 10,
            nodes: []
          },
          {
            key: "id4",
            name: "Operating System",
            curr: 15,
            total: 20,
            nodes: []
          }
        ]
      }
    ]
  },
  {
    key: "id5",
    name: "Category 2",
    curr: 0,
    total: 0,
    nodes: [
      {
        key: "id6",
        name: "Sub Category",
        curr: 12,
        total: 48,
        nodes: [
          {
            key: "id7",
            name: "Inside Sub",
            curr: 12,
            total: 48,
            nodes: []
          }
        ]
      }
    ]
  },
  {
    key: "id8",
    name: "Last One",
    curr: 0,
    total: 0,
    nodes: []
  }
];

/**
 * 递归更新树形结构中指定节点及其父节点的curr值，排除根节点。
 * @param {Array<Object>} nodes - 当前层级的节点数组。
 * @param {string} key - 要查找并更新的目标节点的key。
 * @param {number} depth - 当前节点的深度，根节点为0。
 * @returns {boolean} - 如果当前节点或其子节点中发生了更新，则返回true；否则返回false。
 */
function inc(nodes, key, depth = 0) {
    // 遍历当前层级的每一个节点
    for (let n of nodes) {
        // 检查当前节点的key是否匹配，或者其子节点（如果存在）中是否发生了更新
        // n.nodes ?? [] 用于处理nodes可能为null或undefined的情况
        if (n.key === key || inc(n.nodes ?? [], key, depth + 1)) {
            // 如果当前节点是匹配节点或其祖先节点，并且不是最顶层的根节点（depth > 0）
            if (depth > 0) {
                n.curr++; // 递增当前节点的curr值
            }
            // 返回true，向上层调用者表明在其子树中发生了更新
            return true;
        }
    }
    // 遍历完当前层级，没有找到匹配项，也没有子节点更新
    return false;
}

const data = [
  {
    key: "id1",
    name: "Category 1",
    curr: 0,
    total: 0,
    nodes: [
      {
        key: "id2",
        name: "Applications",
        curr: 20,
        total: 30,
        nodes: [
          {
            key: "id3",
            name: "Gaming",
            curr: 5,
            total: 10,
            nodes: []
          },
          {
            key: "id4",
            name: "Operating System",
            curr: 15,
            total: 20,
            nodes: []
          }
        ]
      }
    ]
  },
  {
    key: "id5",
    name: "Category 2",
    curr: 0,
    total: 0,
    nodes: [
      {
        key: "id6",
        name: "Sub Category",
        curr: 12,
        total: 48,
        nodes: [
          {
            key: "id7",
            name: "Inside Sub",
            curr: 12,
            total: 48,
            nodes: []
          }
        ]
      }
    ]
  },
  {
    key: "id8",
    name: "Last One",
    curr: 0,
    total: 0,
    nodes: []
  }
];

console.log("原始数据:", JSON.stringify(data, null, 2));

// 示例1: 更新 'id4'
inc(data, 'id4');
console.log("\n更新 'id4' 后的数据:", JSON.stringify(data, null, 2));
/* 预期输出:
  id4.curr: 15 -> 16
  id2.curr: 20 -> 21
  id1.curr: 0 (不变，因为 depth > 0 限制)
*/

// 示例2: 更新 'id7'
inc(data, 'id7');
console.log("\n更新 'id7' 后的数据:", JSON.stringify(data, null, 2));
/* 预期输出:
  id7.curr: 12 -> 13
  id6.curr: 12 -> 13
  id5.curr: 0 (不变)
*/

// 示例3: 尝试更新一个不存在的key
inc(data, 'nonExistentKey');
console.log("\n尝试更新不存在的key后的数据 (无变化):", JSON.stringify(data, null, 2));