难度:简单
给你一个整数
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
相关推荐
freexyn4 分钟前
Matlab自学笔记七十六:表达式的展开、因式分解、化简、合并同类项样例过了就是过了7 分钟前
LeetCode热题 不同路径念恒123068 分钟前
Python(列表进阶)276695829233 分钟前
阿里最新acw_sc__v2 分析dog25035 分钟前
圆锥曲线和二次曲线Wadli44 分钟前
27.单调队列Navigator_Z1 小时前
LeetCode //C - 1031. Maximum Sum of Two Non-Overlapping SubarraysWect1 小时前
LeetCode 97. 交错字符串:动态规划详解爱学习的张大1 小时前
具身智能论文问答(三):Open VLAvortex51 小时前
python 库劫持:原理、利用与防御