zoukankan      html  css  js  c++  java
  • class Solution(object): def fizzBuzz(self, n): a = [] i = 1 while(i <= n): if(i%15 == 0): a.append("FizzBuzz") elifleetcode day_01

    412. Fizz Buzz

    Write a program that outputs the string representation of numbers from 1 to n.

    But for multiples of three it should output “Fizz” instead of the number and for the multiples of five output “Buzz”. For numbers which are multiples of both three and five output “FizzBuzz”.

    Example:

    n = 15,
    
    Return:
    [
        "1",
        "2",
        "Fizz",
        "4",
        "Buzz",
        "Fizz",
        "7",
        "8",
        "Fizz",
        "Buzz",
        "11",
        "Fizz",
        "13",
        "14",
        "FizzBuzz"
    ]
    

      自己答案:

    class Solution(object):
             def fizzBuzz(self, n):
          a = []
          i = 1
          while(i <= n):
            if(i%15 == 0):
              a.append("FizzBuzz")

            elif(i%3 == 0):
              a.append("Fizz")
            elif(i%5 == 0):
              a.append("Buzz")

            else:
              a.append(str(i))
            i = i + 1
          return a

      经典答案:

    1.

    class Solution(object):
        def fizzBuzz(self, n):
           return [str(i) if (i%3!=0 and i%5!=0) else (('Fizz'*(i%3==0)) + ('Buzz'*(i%5==0))) for i in range(1,n+1)]
    

    2.

    class Solution(object):
        def fizzBuzz(self, n):
    return["Fizz"*(not i%3) + "Buzz"*(not i %5) or str(i) for i in range(1,n+1)]

    自己的答案没有考虑到列表生成式,没有发挥出Python特点:优雅、简介

    列表生成式资料:

    http://www.liaoxuefeng.com/wiki/001374738125095c955c1e6d8bb493182103fac9270762a000/00138681963899940a998c0ace64bb5ad45d1b56b103c48000

     

  • 相关阅读:
    PPT1 例1
    皇宫看守 树形DP
    没有上司的晚会 树形DP
    将功补过 树形DP
    战略游戏 树形DP
    选课 树形DP
    二叉苹果树 树形DP
    GDOI2016总结
    加分二叉树 树形DP
    [注意]未做的题(最短路)
  • 原文地址:https://www.cnblogs.com/jackzone/p/6070577.html
Copyright © 2011-2022 走看看