js 树向上递归修改数据 有什么好的写法呢! - V2EX
coderabbit

js 树向上递归修改数据 有什么好的写法呢!

  •  
  •   coderabbit Sep 19, 2019 5545 views
    This topic created in 2427 days ago, the information mentioned may be changed or developed.
    let a = [ { key: 1, title: '一级', parentKey: 0, status: {choose: false}, children: [ { key: 10, title: '一级-0', parentKey: 1, status: {choose: false}, children: [ {key: 15, title: '一级-0-1', parentKey: 10, status: {choose: false}} ] }, {key: 11, title: '一级-1', parentKey: 1, status: {choose: false}}, {key: 12, title: '一级-2', parentKey: 1, status: {choose: false}}, {key: 13, title: '一级-3', parentKey: 1, status: {choose: false}}, {key: 14, title: '一级-4', parentKey: 1, status: {choose: false}} ] } ]; 

    我想修改 key 15 每个父级 status 里的 choose 状态。 也就是key 10 key 的 status choose 都为 true 如果是 json 对象很好找,但是已经是树形了向下好找却向上不好找!怎么更优的实现它呢!

    11 replies    2019-09-19 15:06:25 +08:00
    lemontv
        1
    lemontv  
       Sep 19, 2019 via Android
    直接判断当前节点的子节点是否包括 key15
    azh7138m
        2
    azh7138m  
       Sep 19, 2019   2
    autoxbc
        3
    autoxbc  
       Sep 19, 2019   1
    把对象展平就很容易寻址

    https://codepen.io/autoxbc/pen/xxKyWmq
    coderabbit
        4
    coderabbit  
    OP
       Sep 19, 2019
    ```
    let parent = (data, obj) => {
    data.forEach(item => {
    if (item.key === obj.parentKey) {
    item.status.choose = true;
    parent(data, item);
    }
    if (item.children && item.children.length) {
    item.status.choose = true;
    parent(item.children, obj);
    }
    });
    };
    let obj = { key: 15, title: '一级-0-1', parentKey: 10, status: { choose: false } };
    console.log(a);
    ```
    coderabbit
        5
    coderabbit  
    OP
       Sep 19, 2019
    @autoxbc @azh7138m 学习了
    Sczlog
        6
    Sczlog  
       Sep 19, 2019
    改一下数据结构,用一个表型结构来存储所有选项的数据,然后再用类似的树形结构来存储层级。
    12tall
        7
    12tall  
       Sep 19, 2019
    @autoxbc @Sczlog
    学习了!
    感觉有点 B+树的意思哈[这句我瞎说的]
    jorneyr
        8
    jorneyr  
       Sep 19, 2019
    可以获取数据后先给每个节点赋值一个 parent 对象,从下到上就好处理了:

    treeWalk(node) {
    for (let child of node.children) {
    child.parent = node;
    treeWalk(child);
    }
    }
    dany813
        9
    dany813  
       Sep 19, 2019
    @autoxbc 老哥的代码风格,有点迷
    autoxbc
        10
    autoxbc  
       Sep 19, 2019
    @dany813 #9 for 绕了点?在真值判断处赋值可能不合规范,不过很好用,也是链式查找的范式写法
    dany813
        11
    dany813  
       Sep 19, 2019
    @autoxbc 是的 for 的很骚气,看了半天,可能我比较菜吧 哈哈
    About     Help     Advertise     Blog     API     FAQ     Solana     1118 Online   Highest 6679       Select Language
    创意工作者们的社区
    World is powered by solitude
    VERSION: 3.9.8.5 57ms UTC 23:02 PVG 07:02 LAX 16:02 JFK 19:02
    Do have faith in what you're doing.
    ubao msn snddm index pchome yahoo rakuten mypaper meadowduck bidyahoo youbao zxmzxm asda bnvcg cvbfg dfscv mmhjk xxddc yybgb zznbn ccubao uaitu acv GXCV ET GDG YH FG BCVB FJFH CBRE CBC GDG ET54 WRWR RWER WREW WRWER RWER SDG EW SF DSFSF fbbs ubao fhd dfg ewr dg df ewwr ewwr et ruyut utut dfg fgd gdfgt etg dfgt dfgd ert4 gd fgg wr 235 wer3 we vsdf sdf gdf ert xcv sdf rwer hfd dfg cvb rwf afb dfh jgh bmn lgh rty gfds cxv xcv xcs vdas fdf fgd cv sdf tert sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf shasha9178 shasha9178 shasha9178 shasha9178 shasha9178 liflif2 liflif2 liflif2 liflif2 liflif2 liblib3 liblib3 liblib3 liblib3 liblib3 zhazha444 zhazha444 zhazha444 zhazha444 zhazha444 dende5 dende denden denden2 denden21 fenfen9 fenf619 fen619 fenfe9 fe619 sdf sdf sdf sdf sdf zhazh90 zhazh0 zhaa50 zha90 zh590 zho zhoz zhozh zhozho zhozho2 lislis lls95 lili95 lils5 liss9 sdf0ty987 sdft876 sdft9876 sdf09876 sd0t9876 sdf0ty98 sdf0976 sdf0ty986 sdf0ty96 sdf0t76 sdf0876 df0ty98 sf0t876 sd0ty76 sdy76 sdf76 sdf0t76 sdf0ty9 sdf0ty98 sdf0ty987 sdf0ty98 sdf6676 sdf876 sd876 sd876 sdf6 sdf6 sdf9876 sdf0t sdf06 sdf0ty9776 sdf0ty9776 sdf0ty76 sdf8876 sdf0t sd6 sdf06 s688876 sd688 sdf86