| Category | Difficulty | Likes | Dislikes |
|---|
| algorithms | Easy (71.31%) | 177 | - |
Tags
Unknown
Companies
Unknown
给你一个整数 n ，找出从 1 到 n 各个整数的 Fizz Buzz 表示，并用字符串数组 answer（下标从 1 开始）返回结果，其中：
answer[i] == "FizzBuzz" 如果 i 同时是 3 和 5 的倍数。answer[i] == "Fizz" 如果 i 是 3 的倍数。answer[i] == "Buzz" 如果 i 是 5 的倍数。answer[i] == i （以字符串形式）如果上述条件全不满足。
示例 1：
1
2
| 输入：n = 3
输出：["1","2","Fizz"]
|
示例 2：
1
2
| 输入：n = 5
输出：["1","2","Fizz","4","Buzz"]
|
示例 3：
1
2
| 输入：n = 15
输出：["1","2","Fizz","4","Buzz","Fizz","7","8","Fizz","Buzz","11","Fizz","13","14","FizzBuzz"]
|
提示：
Discussion | Solution
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
| class Solution {
public:
vector<string> fizzBuzz(int n) {
int i = 0;
vector<string> res;
while (i++<n) {
if(!(i%15)) {
res.push_back("FizzBuzz");
} else if (!(i%3)) {
res.push_back("Fizz");
} else if (!(i%5)) {
res.push_back("Buzz");
} else {
res.push_back(to_string(i));
}
}
return res;
}
};
|