Recursively delete, if the array is empty, delete this attribute

  1. Delete a recursive tree, delete this attribute if there is an empty subList: [], and keep
if subList is not empty. 
// :

[
    {
        "paramId":500061,
        "sourcePath":"Status",
        "weight":100,
        "subList":[

        ]
    },
    {
        "paramId":500045,
        "sourcePath":"Result",
        "weight":100,
        "subList":[
            {
                "paramId":500042,
                "sourcePath":"Partners",
                "weight":100,
                "subList":[
                    {
                        "paramId":500043,
                        "sourcePath":"StockName",
                        "weight":100,
                        "subList":[

                        ]
                    },
                    {
                        "paramId":500027,
                        "sourcePath":"ShoudDate",
                        "weight":100,
                        "subList":[

                        ]
                    }
                ]
            }
        ]
    }
]

/ / output 

[
    {
        "paramId":500061,
        "sourcePath":"Status",
        "weight":100,
    },
    {
        "paramId":500045,
        "sourcePath":"Result",
        "weight":100,
        "subList":[
            {
                "paramId":500042,
                "sourcePath":"Partners",
                "weight":100,
                "subList":[
                    {
                        "paramId":500043,
                        "sourcePath":"StockName",
                        "weight":100,
                    },
                    {
                        "paramId":500027,
                        "sourcePath":"ShoudDate",
                        "weight":100,
                    }
                ]
            }
        ]
    }
]
Javascript
Apr.09,2021 
const arr = [
  {
    "paramId":500061,
    "sourcePath":"Status",
    "weight":100,
    "subList":[

    ]
  },
  {
    "paramId":500045,
    "sourcePath":"Result",
    "weight":100,
    "subList":[
      {
        "paramId":500042,
        "sourcePath":"Partners",
        "weight":100,
        "subList":[
          {
            "paramId":500043,
            "sourcePath":"StockName",
            "weight":100,
            "subList":[

            ]
          },
          {
            "paramId":500027,
            "sourcePath":"ShoudDate",
            "weight":100,
            "subList":[

            ]
          }
        ]
      }
    ]
  }
];

const result = JSON.parse(JSON.stringify(arr).replace(/,"subList":\[]/g,''));
console.log(result)


----------


const handel = (item, attr) => (item[attr] && item[attr].length ? item[attr].forEach(row => (handel(row, attr))) : delete item[attr]);
arr.forEach(item => handel(item, 'subList'));
console.log(arr)

questions of the same nature are asked twice in a different way.
https://codeshelper.com/q/10.
has given the answer to the last question, and the answer to this question remains the same 





function handleRecur(data) {
  return data.reduce((iter, val) => {
    val = {...val};
    val.subList.length ? val.subList = handleRecur(val.subList) : delete val.subList;
    iter.push(val);
    return iter;
  }, []);
}

Previous: How do you tell thinkphp not to display an error in the page you want to view and automatically jump after two seconds, but instead to show a specific error?

Next: Hexo push issu

css mysql arrays josn react html typescript webpack npm sass R objective-c .net sql-server jquery python-3.x angularjs django angular excel regex iphone ajax linux xml pandas vba spring database wordpress string wpf xcode windows bash postgresql oracle multithreading eclipse list firebase algorithm macos forms image scala visual-studio azure bootstrap spring-boot react-native python-2.7 docker performance function winforms matlab powershell apache dataframe api sqlite numpy rest shell selenium flutter dart maven loops qt swing android-studio csv express file class tensorflow sorting codeigniter perl
© 2021 CodesHelper
Advertising Contact us About us
Menu