算法題小try

 

const mkList = n =>
  n <= 2 ? [0, 1].slice(0, n) : mkList(n - 1).concat(2 * n - 3);
const isPrim = n =>
  Array.from({ length: n }).filter((_, i) => !(n % i)).length <= 2;
const sumWhile = f => list =>
  list.reduce((acc, n) => (f(n) ? acc + n : acc), 0);
sumWhile(isPrim)(mkList(5));

var mkList = n =>
  [0].concat(
    Array(n - 1)
      .fill(1)
      .map((o, i) => i * 2 + 1)
  );
var isPrim = (primeList => n =>
  n < 2 && n > 0
    ? true
    : primeList.find(p => n % p === 0)
      ? false
      : primeList.push(n))([2]);
var reduce = isPrim => list =>
  list.reduce((length, r) => (isPrim(r) ? l + r : l), 0);
reduce(isPrim)(mkList(10));