leetcode_412_Fizz Buzz

写一个程序,输出从 1 到 n 数字的字符串表示。

1. 如果 是3的倍数,输出“Fizz”;

2. 如果 是5的倍数,输出“Buzz”;

3.如果 同时是3和5的倍数,输出 “FizzBuzz”。

示例:

n = 15,

返回:
[
    "1",
    "2",
    "Fizz",
    "4",
    "Buzz",
    "Fizz",
    "7",
    "8",
    "Fizz",
    "Buzz",
    "11",
    "Fizz",
    "13",
    "14",
    "FizzBuzz"
]

class Solution {
public:
    vector<string> fizzBuzz(int n) {
        vector<string> result;
        for(int i=1;i<n+1;i++)
        {
            if  ((i%3!= 0)&&(i%5!=0)) result.push_back(to_string(i));
             else if ((i%3==0)&&(i%5==0)) result.push_back("FizzBuzz");
                else if (i%3==0) result.push_back("Fizz");
                    else result.push_back("Buzz");                        
        }
        return result;        
    }
};
注意把情况多的放在前面,运行时间会减少
push_back

猜你喜欢

转载自blog.csdn.net/snow_jie/article/details/80848099