配列内の奇数の検索

配列の中で奇数を探して、奇数の中の小数と奇数の和を求めます

let oddnumber = [12, 77, 38, 41, 53, 92, 85];

function odd1(oddnumber) {
  let answer = { sum: 0, min: Number.MAX_SAFE_INTEGER };
  let newArr = [];
  for (let i of oddnumber) {
    if (i % 2 === 1) {
      newArr.push(i);
    }
  }
  for (let a = 0; a < newArr.length; a++) {
    answer.sum += newArr[a];
  }

  for (let j = 0; j < newArr.length; j++) {
    if (newArr[j] < answer.min) answer.min = newArr[j];
  }

  return answer;
}

console.log(odd1(oddnumber));

function odd2(oddarr) {
   let answer = [];
   let sum = 0,
     min = Number.MAX_SAFE_INTEGER;
   for (let x of oddarr) {
     if (x % 2 === 1) {
       sum += x;
       if (x < min) min = x;
     }
   }
   answer.push(sum);
   answer.push(min);
   return answer;
}

console.log(odd2(oddnumber));