难度:简单
给你一个整数
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
题解:
pythonclass Solution(object): def fizzBuzz(self, n): res = [] for i in range(1,n+1): # print(i) if i % 3== 0 and i %5 == 0: res.append('FizzBuzz') elif i%3 == 0: res.append('Fizz') elif i%5 == 0: res.append('Buzz') else: res.append(str(i)) return res
leetcode:412. Fizz Buzz(python3解法)
心软且酷丶2024-01-10 21:31
相关推荐
helloyangkl3 分钟前
Draco——参数说明API技术员8 分钟前
京东API接口:如何高效获取商品详情与SKU信息!chen33 分钟前
自适应滤波算法FPGA实现思路sort浅忆34 分钟前
deeptest执行接口脚本,添加python脚本断言救救孩子把40 分钟前
51-机器学习与大模型开发数学教程-4-13 EM算法与混合模型冷月半明43 分钟前
trea solo,让我从牛马外包翻身当“甲方”Ka1Yan1 小时前
[二叉树] - 代码随想录:二叉树的统一迭代遍历xu_yule1 小时前
算法基础(数论)—欧拉函数Brduino脑机接口技术答疑1 小时前
TDCA 算法在 SSVEP 场景中的训练必要性xu_yule1 小时前
算法基础(数学)—数论