FCC 斐波纳契数列

function sumFibs(num) {
  var f=[1,1];
  var i=1;
  var sum=0;
  while(f[i]<=num){
    i++;
    f.push(f[i-1]+f[i-2]);
  }
   for(var j=0;j<f.length-1;j++){
     if(f[j]%2!=0)sum+=f[j];
   }
   return sum;
}

sumFibs(1000);