412.FizzBuzz(javascript)
原创给你一个整数 n ,找出从 1 到 n 每个整数的 Fizz Buzz 表示并使用字符串数组 answer(下标从 1 Start)返回结果,其中:
- answer[i] == “FizzBuzz” 如果 i 同时是 3 和 5 的倍数。
- answer[i] == “Fizz” 如果 i 是 3 的倍数。
- answer[i] == “Buzz” 如果 i 是 5 的倍数。
- answer[i] == i (以字符串形式),如果不满足上述条件。
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.
示例 1:
输入:n = 3
输出:["1","2","Fizz"]
示例 2:
输入:n = 5
输出:["1","2","Fizz","4","Buzz"]
示例 3:
输入:n = 15
输出:["1","2","Fizz","4","Buzz","Fizz","7","8","Fizz","Buzz","11","Fizz","13","14","FizzBuzz"]
var fizzBuzz = function (n) {
let newList = new Array(n).fill(0)
for (let i = 0; i < newList.length; i++) {
newList[i] = i + 1;
if (newList[i] % 15 == 0) {
newList[i] = "FizzBuzz";
} else if (newList[i] % 3 == 0) {
newList[i] = "Fizz";
} else if (newList[i] % 5 == 0) {
newList[i] = "Buzz";
}else{
newList[i] = newList[i].toString();
}
}
return newList
};
leetcode: https://leetcode-cn.com/problems/fizz-buzz/
版权声明
所有资源都来源于爬虫采集,如有侵权请联系我们,我们将立即删除
上一篇:element-ui中用el-tree垂直滚动条不展示 下一篇:vue版本
itfan123



