g0401_0500.s0412_fizz_buzz.readme.md Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java17 Show documentation

Java Solution for LeetCode algorithm problems, continually updating

There is a newer version: 1.24

412\. Fizz Buzz

Easy

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:**

**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 <= 10⁴