알고리즘 45 - Count by X

tamagoyakii·2021년 10월 15일
0

알고리즘

목록 보기
45/89

Q.

Create a function with two arguments that will return an array of the first (n) multiples of (x).

Assume both the given number and the number of times to count will be positive numbers greater than 0.

Return the results as an array (or list in Python, Haskell or Elixir).

Examples:

countBy(1,10) === [1,2,3,4,5,6,7,8,9,10]
countBy(2,5) === [2,4,6,8,10]

A)

function countBy(x, n) {
  let z = [];
  for (let i = x; i <= x * n; i += x) z.push(i);
  return z;
}

0개의 댓글