(LeetCode) 412. Fizz Buzz

412. Fizz Buzz

  • Explore : Interview > Top Interveiw Questions > Easy Collection
  • 분류 : Math
  • 난이도 : Easy

Problem

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

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"]

Constraints

  • 1 <= n <= 10^4

Solution

Exapnder
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
class Solution {
fun fizzBuzz(n: Int): List<String> {
var fizzbuzz = ArrayList<String>()

for (i in 1 .. n) {
if (i % 3 == 0 && i % 5 == 0) {
fizzbuzz.add("FizzBuzz")
}
else if (i % 3 == 0) {
fizzbuzz.add("Fizz")
}
else if (i % 5 == 0) {
fizzbuzz.add("Buzz")
}
else {
fizzbuzz.add(i.toString())
}
}
return fizzbuzz
}
}

Point of Thinking

  • 문제 조건대로만 if문으로 분기하면 Accepted.