跳转至

412.fizz-buzz

Statement

Metadata
  • Link: Fizz Buzz
  • Difficulty: Easy
  • Tag: 数学 字符串 模拟

给你一个整数 n ,找出从 1n 各个整数的 Fizz Buzz 表示,并用字符串数组 answer下标从 1 开始)返回结果,其中:

  • answer[i] == "FizzBuzz" 如果 i 同时是 35 的倍数。
  • answer[i] == "Fizz" 如果 i3 的倍数。
  • answer[i] == "Buzz" 如果 i5 的倍数。
  • 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

Metadata
  • Link: Fizz Buzz
  • Difficulty: Easy
  • Tag: 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 (as a string) if none 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

Solution

from typing import List


class Solution:
    def fizzBuzz(self, n: int) -> List[str]:
        def run(x: int) -> str:
            s = ""

            if x % 3 == 0:
                s = s + "Fizz"
            if x % 5 == 0:
                s = s + "Buzz"

            if len(s) == 0:
                s = str(x)

            return s

        return list(map(run, range(1, n + 1)))

最后更新: October 11, 2023
回到页面顶部