412. Fizz Buzz

1. Question

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.

2. Examples

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

3. Constraints

  • 1 <= n <= 104

4. References

来源:力扣(LeetCode) 链接:https://leetcode-cn.com/problems/fizz-buzz 著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。

5. Solutions

class Solution {
  public List<String> fizzBuzz(int n) {
    ArrayList<String> list = new ArrayList<>();
    for (int i = 1; i <= n; i++) {
      if(i%3 == 0 && i%5 == 0){
        list.add("FizzBuzz");
      }else if(i%3 == 0){
        list.add("Fizz");
      }else if(i%5 == 0){
        list.add("Buzz");
      }else {
        list.add(String.valueOf(i));
      }
    }
    return list;
  }
}
Copyright © rootwhois.cn 2021-2022 all right reserved,powered by GitbookFile Modify: 2022-05-18 16:24:00

results matching ""

    No results matching ""