412. Fizz Buzz

I like to read this solution as a small machine: keep the useful information, throw away the noise. For 412. Fizz Buzz, the solution in this repository is mainly a straightforward implementation solution.

Guide

What?

The code is easier to read if we treat it as a controlled search through possible states. Instead of trying to be clever immediately, read the code as a sequence of questions:

What state are we keeping?
How do we move from one state to the next?
When do we know the answer is already determined?

For this file, the main tools are: straightforward implementation.

Guide

When?

Use this approach when the hard part is not syntax, but deciding what must stay true after every update. The accepted code reduces that pressure by storing exactly the information that remains useful later.

The important function names to track are fizzBuzz.

Guide

Why?

The win comes from making each line carry responsibility: store the useful state, discard the rest, keep moving.

The final return is not magic; it is the invariant after the loops or recursion have finished doing their accounting.

Guide

How?

Walk through the solution in this order:

Initialize the memory or helper structure.
Process candidates in the order the invariant expects.
Update the answer only when the current state is valid.
Return the value that represents the fully processed input.

The most important competitive-programming habit here is to trust the invariant. Once the invariant is right, the loops become much less scary.

Guide

Complexity

Time: O(n) to O(n log n), depending on the dominant loop or data structure operation
Space: O(n) in the usual case for auxiliary containers or recursion

Guide

C++ Solution

Your submission

The accepted solution

solution.cpp

01//Runtime: 4 ms, faster than 98.48% of C++ online submissions for Fizz Buzz.
02//Memory Usage: 7.4 MB, less than 87.67% of C++ online submissions for Fizz Buzz.
03class Solution {
04public:
05    vector<string> fizzBuzz(int n) {
06        vector<string> ans(n);
07
08        for(int i = 0; i < n; ++i){
09            if((i+1)%15 == 0){
10                ans[i] = "FizzBuzz";
11            }else if((i+1)%3 == 0){
12                ans[i] = "Fizz";
13            }else if((i+1)%5 == 0){
14                ans[i] = "Buzz";
15            }else{
16                ans[i] = to_string(i+1);
17            }
18        }
19
20        return ans;
21    }
22};

Cost

Complexity

Time

O(n) to O(n log n), depending on the dominant loop or data structure operation

Dominated by the main traversal, recursion, or data-structure operations in the code.

Space

O(n) in the usual case for auxiliary containers or recursion

Auxiliary state plus the answer structure where the problem requires one.