难度:简单
给你一个整数
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
相关推荐
咖啡の猫1 小时前
Python字典推导式曹文杰15190301121 小时前
2025 年大模型背景下应用统计本科 计算机方向 培养方案leiming61 小时前
C++ vector容器Wulida0099912 小时前
建筑物表面缺陷检测与识别:基于YOLO11-C3k2-Strip模型的智能检测系统FJW0208142 小时前
Python_work4Xの哲學2 小时前
Linux流量控制: 内核队列的深度剖析爱笑的眼睛113 小时前
从 Seq2Seq 到 Transformer++:深度解构与自构建现代机器翻译核心组件yaoh.wang3 小时前
力扣(LeetCode) 88: 合并两个有序数组 - 解法思路执笔论英雄3 小时前
【RL】slime创建actor的流程吴佳浩 Alben3 小时前
Python入门指南(四)