难度简单224收藏分享切换为英文接收动态反馈
给你一个整数 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:
输入: 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"]
提示:
1 <= n <= 104
我的代码:
class Solution {
public:
vector<string> fizzBuzz(int n) {
vector<string> ans;
for (int i = 1; i <= n; ++ i)
{
string t = "";
if (i % 3 == 0) t += "Fizz";
if (i % 5 == 0) t += "Buzz";
if (t.size() == 0) t += to_string(i);
ans.push_back(t);
}
return ans;
}
};
扫码关注腾讯云开发者
领取腾讯云代金券
Copyright © 2013 - 2025 Tencent Cloud. All Rights Reserved. 腾讯云 版权所有
深圳市腾讯计算机系统有限公司 ICP备案/许可证号:粤B2-20090059 深公网安备号 44030502008569
腾讯云计算(北京)有限责任公司 京ICP证150476号 | 京ICP备11018762号 | 京公网安备号11010802020287
Copyright © 2013 - 2025 Tencent Cloud.
All Rights Reserved. 腾讯云 版权所有