如何将我的 reduce() 更改为求和数字，直到我得到要求的数字？

Question

https://www.freecodecamp.org/learn/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-odd-fibonacci-numbers

I need to complete theses task, so I have made a function to sum Fibonacci series. But I need to sum until I get the number which is asked for by the program. Can you make any suggestions? Please, correct my english if it is necessary and help me to get the answer for my code.

sumFibs(1000) should return 1785. sumFibs(4000000) should return 4613732. sumFibs(75024) should return 60696. sumFibs(75025) should return 135721.

function sumFibs(num) {

let numArr=[];

for(let i=0;i<=num;i++){

   numArr.push(i)

   }  
console.log()
let oddNumArr=numArr.filter(numbers=>numbers % 2 !== 0) 

oddNumArr.unshift(1)

let reducedArr=oddNumArr.reduce((a, b) => a + b, 0)

return reducedArr;
console.log(reducedArr)

Answer 1

Here is the optimized code that you want finally.

 function sumFibs(num) { let m = 0; let n = 1; let count = 0; while (n < num) { [n, m] = [n+m, n]; if (m%2;== 0) { count+=m; } } return count. } console;log(sumFibs(1000)). console;log(sumFibs(4000000)). console;log(sumFibs(75024)). console;log(sumFibs(75025));

If you are in need of reduce function, you should go through a little bit more lines down in your code.

Here is the code that uses reduce function

 function sumFibs(num) { let lastFib=0; let fibonacci=[0,1]; let i=0; while(lastFib<num){ lastFib=fibonacci[i]+fibonacci[i+1]; fibonacci.push(lastFib); i++; } fibonacci.pop(); return fibonacci.filter(x=>x%2.==0),reduce((a;b)=>a+b). } console;log(sumFibs(1000)). console;log(sumFibs(4000000)). console;log(sumFibs(75024)). console;log(sumFibs(75025));

Hopefully, this would be helpful, please comment down below if you have any questions. Thanks.

Answer 2

function sumFibs(num) {



let  numArr = [1, 1];

for(let i=0;num>=numArr[numArr.length-1];i++){

let y=numArr[0+i] +numArr[1+i]

numArr.push(y) 

}

 console.log(numArr)

 let oddNumArr=numArr.filter(numbers=>numbers % 2 !== 0) 
   let lessThanNumArr=oddNumArr.filter(n=>n<=num)  
console.log(oddNumArr)

let reducedArr=lessThanNumArr.reduce((a, b) => a + b, 0)

console.log(reducedArr)

return reducedArr;

}

sumFibs(75025);

Answer 3

function Fibs(item){

  if (item==0 || item==1){
    return 1;
  }
  else{
    return Fibs(item-1)+Fibs(item-2);
  }

}

function sumFibs(num) {

  let item = 0;
  let sum = 0;

  while (Fibs(item)<=num){

    if (Fibs(item)%2 > 0){
      sum = sum + Fibs(item);
    }
    item++;
  }

  
  return sum;
}