-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFizz_Buzz.js
33 lines (23 loc) · 812 Bytes
/
Fizz_Buzz.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
// Given an integer n, return a string array answer (1-indexed) where:
// answer[i] == "FizzBuzz" if i is divisible by 3 and 5.
// answer[i] == "Fizz" if i is divisible by 3.
// answer[i] == "Buzz" if i is divisible by 5.
// answer[i] == i (as a string) if none of the above conditions are true.
// Example 1:
// Input: n = 3
// Output: ["1","2","Fizz"]
// Example 2:
// Input: n = 5
// Output: ["1","2","Fizz","4","Buzz"]
// Example 3:
// Input: n = 15
// Output: ["1","2","Fizz","4","Buzz","Fizz","7","8","Fizz","Buzz","11","Fizz","13","14","FizzBuzz"]
// Constraints:
// 1 <= n <= 104
/**
* @param {number} n
* @return {string[]}
*/
var fizzBuzz = function (n) {
return new Array(n).fill(0).map((a, i) => (++i % 3 ? "" : "Fizz") + (i % 5 ? "" : "Buzz") || i.toString());
};