难度:简单
给你一个整数
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
相关推荐
ZhengEnCi1 小时前
P2L-Matplotlib饼图完全指南-从数据可视化到图表定制的Python绘图利器曲幽1 小时前
你的REST接口还在“过度投喂”数据吗?——FastAPI + GraphQL实战避坑指南用户8358086187912 小时前
基于 Self-RAG 与列表级重排序的进阶 RAG 系统设计与实现To_OC12 小时前
LC 207 课程表:刚学图论那会儿,我连这是拓扑排序都没看出来To_OC12 小时前
LC 208 实现 Trie 前缀树:曾被名字劝退,写完发现是送分题BadBadBad__AK14 小时前
线段树维护区间 k 次方和Warson_L19 小时前
Python `Annotated` 与 LangGraph Reducer 学习笔记韩师傅19 小时前
海天线算法的前世今生韩师傅19 小时前
当你的甲方设备过烂,要如何快速出效果?Warson_L19 小时前
LangGraph的MessageState and HumanMessage