Fizz Buzz

Posted on Edited on In Views:

412.Fizz Buzz

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:

1
2
Input: n = 3
Output: ["1","2","Fizz"]

Example 2:

1
2
Input: n = 5
Output: ["1","2","Fizz","4","Buzz"]

Example 3:

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

时间复杂度：O(n)

空间复杂度：O(1)

1
2
3
4
5
6
7
8
9
10
11
12
13
class Solution {
public:
    vector<string> fizzBuzz(int n) {
        vector<string> ans_vec;
        for (int i = 1; i <= n; i++) {
            if (i % 3 == 0 && i % 5 == 0)ans_vec.push_back("FizzBuzz");
            else if (i % 3 == 0)ans_vec.push_back("Fizz");
            else if (i % 5 == 0)ans_vec.push_back("Buzz");
            else ans_vec.push_back(to_string(i));
        }
        return ans_vec;
    }
};