-Code
class Solution {
public List<String> fizzBuzz(int n) {
List<String> answer = new ArrayList<>();
for (int i = 1; i <= n; i++) {
if (i % 3 == 0 && i % 5 == 0) {
answer.add("FizzBuzz");
} else if (i % 3 == 0) {
answer.add("Fizz");
} else if (i % 5 == 0) {
answer.add("Buzz");
} else {
answer.add("" + i);
}
}
return answer;
}
}
'Beakjoon&프로그래머스 > Java' 카테고리의 다른 글
[LeetCode/Java] 876. Middle of the Linked List (0) | 2025.06.10 |
---|---|
[LeetCode/Java] 1342. Number of Steps to Reduce a Number to Zero (0) | 2025.06.10 |
[LeetCode/Java] 1672. Richest Customer Wealth (0) | 2025.06.10 |
[LeetCode/Java] 2236. Root Equals Sum of Children (0) | 2025.06.10 |
[LeetCode/Java] 1480. Running Sum of 1d Array (1) | 2025.06.09 |