-
Notifications
You must be signed in to change notification settings - Fork 0
/
412.FizzBuzz.py
42 lines (36 loc) · 993 Bytes
/
412.FizzBuzz.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
"""
412. Fizz Buzz
Easy
Math | String | Simulation
---
Given an integer n, return a string array answer (1-indexed) where:
answer[i] == "FizzBuzz" if i is divisible by 3 and 5.
answer[i] == "Fizz" if i is divisible by 3.
answer[i] == "Buzz" if i is divisible by 5.
answer[i] == i if non of the above conditions are true.
Example 1:
Input: n = 3
Output: ["1","2","Fizz"]
Example 2:
Input: n = 5
Output: ["1","2","Fizz","4","Buzz"]
Example 3:
Input: n = 15
Output: ["1","2","Fizz","4","Buzz","Fizz","7","8","Fizz","Buzz","11","Fizz","13","14","FizzBuzz"]
Constraints:
1 <= n <= 104
"""
from typing import List
class Solution:
def fizzBuzz(self, n: int) -> List[str]:
res = []
for i in range(1, n + 1):
if i % 15 == 0:
res.append("FizzBuzz")
elif i % 5 == 0:
res.append("Buzz")
elif i % 3 == 0:
res.append("Fizz")
else:
res.append(f"{i}")
return res