Js recursive summation

A={
    value:1,
    items:[A,A,A] //itemsA
}

is there any good way to find the sum of all the value in object A

Javascript
Feb.27,2021 
function sum(arr) {
  var _sum = 0;
  arr.forEach(v => _sum += v);
  return _sum;
}

function sumA(A) {
  if(A.items && A.items.length) {
    return sum([A.value].concat(a.items.map(sumA)));
  } else {
    return A.value;
  }
}

finally call sumA to sum. I wonder if this meets your requirements?

The concat in

sumA is for tail recursive optimization, but I'm not sure if you can do tail recursive optimization by writing this. A more understandable version: 

function sumA(A) {
  if(A.items && A.items.length) {
    var sum = A.value;
    for(let a of A.items) {
      sum += sumA(a);
    }
    return sum;
  } else {
    return A.value;
  }
}

Previous: Yarn installation of jquery doubts?

Next: WeChat Mini Programs interceptor

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