难度:简单
给你一个整数
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
相关推荐
字节高级特工3 分钟前
C++从入门到熟悉:深入剖析const和constexprCathy Bryant3 分钟前
聊聊拓扑学Lisssaa3 分钟前
打卡第二十七天XWalnut8 分钟前
LeetCode刷题 day2Tisfy9 分钟前
LeetCode 2946.循环移位后的矩阵相似检查:模拟(左即是右)互联网时光机28 分钟前
TikToken 使用教程:从原理到实战,一文搞懂 OpenAI 的文本分词利器zhishidi28 分钟前
推荐算法核心课:基于距离的相似度度量Trouvaille ~30 分钟前
【优选算法篇】队列与宽度优先搜索(BFS)——层层递进的视野hanlin0333 分钟前
动态规划专练:力扣第509、70、746题CoderIsArt34 分钟前
shor算法