zoukankan      html  css  js  c++  java
  • LintCode-9.Fizz Buzz 问题

    Fizz Buzz 问题

    给你一个整数n. 从 1 到 n 按照下面的规则打印每个数:

    • 如果这个数被3整除,打印fizz.
    • 如果这个数被5整除,打印buzz.
    • 如果这个数能同时被3和5整除,打印fizz buzz.

    样例

    比如 n = 15, 返回一个字符串数组:
    [
         "1", "2", "fizz",
         "4", "buzz", "fizz",
         "7", "8", "fizz",
         "buzz", "11", "fizz",
         "13", "14", "fizz buzz"
    ]

    标签

    枚举法 基本实现

    code

    class Solution {
    public:
        /**
         * param n: As description.
         * return: A list of strings.
         */
        vector<string> fizzBuzz(int n) {
            vector<string> result;
            for (int i = 1; i <= n; i++)  {
                if (i % 15 == 0)  {
                    result.push_back("fizz buzz");
                } else if (i % 3 == 0) {
                    result.push_back("fizz");
                } else if (i % 5 == 0) {
                    result.push_back("buzz");
                } else {
                    result.push_back(to_string(i));
                }
            }
            return result;
        }
    };
  • 相关阅读:
    DDPG
    Actor Critic
    Policy Gradients
    DQN
    Sarsa
    粘滞键
    Codeforces Round #236 (Div. 2) E. Strictly Positive Matrix 强连通
    hdu 1853 Cyclic Tour KM
    hdu 3435 A new Graph Game KM
    hdu 3488 Tour KM
  • 原文地址:https://www.cnblogs.com/libaoquan/p/6806405.html
Copyright © 2011-2022 走看看