> For the complete documentation index, see [llms.txt](https://jaywin.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://jaywin.gitbook.io/leetcode/solutions/0412-fizz-buzz.md).

# 0412. Fizz Buzz

<https://leetcode.com/problems/fizz-buzz>

## Description

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` if non of the above conditions are true.

**Example 1:**

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

**Example 2:**

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

**Example 3:**

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

**Constraints:**

* `1 <= n <= 104`

## ac

```java
class Solution {
    public List<String> fizzBuzz(int n) {
        List<String> res = new ArrayList<String>();

        for (int i = 1; i <= n; i++) {
            if (i % 15 == 0) {
                res.add("FizzBuzz");
            } 
            else if (i % 3 == 0) {
                res.add("Fizz");
            }
            else if (i % 5 == 0) {
                res.add("Buzz");
            } else {
                res.add("" + i);
            }
        } 

        return res;
    }
}
```