positiveSum

codewars challenge

by trentHarlem

JavaScript

let arr = []

function positiveSum(arr) {
      if (arr.length <= 0) {
        console.log('1',arr)
        return 0
      }
      else if (arr.length > 0) {
        console.log('2',arr)
          let pos = arr.filter(checkPositive)
          let sum = pos.reduce(add, 0)
        return sum
      }
      
}

function checkPositive(arr) {
  return arr >= 0;
}

function add(total, num) {
  return total + num;
  }
  
console.log(positiveSum([1, 2, 3, 4, 5]), 15);
console.log(positiveSum([1, -2, 3, 4, 5]), 13);
console.log(positiveSum([]), 0);
console.log(positiveSum([-1, 2, 3, 4, -5]), 9);
console.log(positiveSum([-1, -2, -3, -4, -5]), 0);